A Hybrid Algorithm for Solving the Economic Lot and Delivery Scheduling Problem in the Common Cycle Case

Suquan Ju, Jens Clausen

AbstractThe ELDSP problem is a combined lot sizing and sequencing problem. A supplier produces and delivers components of different component types to a consumer in batches. The task is to determine the cycle time, i.e. that time between deliveries, which minimizes the total cost per time unit. This includes the determination of the production sequence of the component types within each cycle.

We investigate the computational behavior of two published algorithms, a heuristic and an optimal algorithm. With large number of component types, the optimal algorithm has long running times. We devise a hybrid algorithm, which is both optimal and efficient.
TypeTechnical report
Year2004
PublisherInformatics and Mathematical Modelling, Technical University of Denmark, DTU
AddressRichard Petersens Plads, Building 321, DK-2800 Kgs. Lyngby
SeriesIMM-Technical Report-2004-10
Electronic version(s)[pdf] [ps]
BibTeX data [bibtex]
IMM Group(s)Operations Research