TY - RPRT
T1 - A Hybrid Algorithm for Solving the Economic Lot and Delivery Scheduling Problem in the Common Cycle Case
AU - Ju, Suquan
AU - Clausen, Jens
PY - 2004
Y1 - 2004
N2 - The 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.
AB - The 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.
M3 - Report
T3 - IMM-Technical Report-2004-10
BT - A Hybrid Algorithm for Solving the Economic Lot and Delivery Scheduling Problem in the Common Cycle Case
PB - Informatics and Mathematical Modelling, Technical University of Denmark, DTU
ER -