haku: @indexterm Scheduling / yhteensä: 635
viite: 287 / 635
| Tekijä: | Cattrysse, D. |
| Otsikko: | A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup times |
| Lehti: | Management Science
1993 : APR, VOL. 39:4, p. 477-486 |
| Asiasana: | HEURISTIC METHODS LOT-SIZE MODEL SCHEDULING |
| Kieli: | eng |
| Tiivistelmä: | In this paper the Discrete Lotsizing and Scheduling Problem (DLSP) with setup times is considered. DLSP is the problem of determining the sequence and size of production batches for multiple items on a single machine. 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). The authors present a dual ascent and column generation heuristic to solve SPP. The quality of the solutions can be measured , since the heuristic generates lower and upper bounds. |
SCIMA