Resource title

Heuristics for the discrete lotsizing and scheduling problems with setup times

Resource image

image for OpenScout resource :: Heuristics for the discrete lotsizing and scheduling problems with setup times

Resource description

In this paper the Discrete Lot-Sizing and Scheduling Problem (DLSP) -that of determining the sequence and size of production batches for multiple items on a single machine- is considered, with setup times. The objective is to find a minimal cost production schedule such that dynamic demand is fulfilled without backlogging. DLSP is formulated as a Set Partitioning Problem (SPP). This paper presents primal and dual heuristics to solve SPP, using column generation. The quality of the solutions can be measured, since the heuristics generate lower and upper bounds. Computational results on a personal computer show that the heuristics are rather effective, both in terms of the quality of the solutions and of required memory and computation time

Resource author

Resource publisher

Resource publish date

Resource language

en

Resource content type

application/pdf

Resource resource URL

http://flora.insead.edu/fichiersti_wp/Inseadwp1991/91-17.pdf

Resource license

Copyright INSEAD. All rights reserved