On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times

Operations Research Letters

Volumn 37, Issue 1, 2009, Pages 32-36

  Gicquel, C ^a   Minoux, M ^b   Dallery, Y ^a  

^a LGI   (France)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Lot sizing; Mixed integer programming; Sequence dependent setup costs; Setup times

Indexed keywords

DYNAMIC PROGRAMMING; SCHEDULING;

CHANGEOVER COSTS; CHANGEOVER TIMES; COMMERCIAL SOLVERS; COMPUTATIONAL RESULTS; INTEGER PROGRAMS; LOT-SIZING; MIXED-INTEGER PROGRAMMING; SCHEDULING PROBLEMS; SEQUENCE-DEPENDENT SETUP COSTS; SETUP TIMES; SOLUTION PROCEDURES;

INTEGER PROGRAMMING;

EID: 58049202109     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2008.10.001     Document Type: Article

References (11)

1. Belvaux G., and Wolsey L.A. Modelling practical lot-sizing problems as mixed-integer programs. Management Science 47 7 (2001) 993-1007
2. Drexl A., and Kimms A. Lot sizing and scheduling-Survey and extensions. European Journal of Operational Research 9 (1997) 221-235
3. Fleischmann B. The discrete lot sizing and scheduling problem. European Journal of Operational Research 44 (1990) 337-348
4. Jans R., and Degraeve Z. Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches. European Journal of Operational Research 177 (2007) 1855-1875
5. Jordan C., and Drexl A. Discrete lotsizing and scheduling by batch sequencing. Management Science 44 5 (1998) 698-713
6. Nemhauser G., and Wolsey L.A. Integer and Combinatorial Optimization (1988), John Wiley & Sons
7. Pochet Y., and Wolsey L.A. Production Planning by Mixed Integer Programming (2006), Springer Science
8. Salomon M., Kroon L.G., Kuik R., and van Wassenhove L.N. Some extensions of the discrete lotsizing and scheduling problem. Management Science 37 7 (1991) 801-812
9. Salomon M., Solomon M., van Wassenhove L.N., Dumas Y., and Dauzère-Pérès S. Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows. European Journal of Operational Research 100 (1997) 494-513
10. van Eijl C.A., and van Hoesel C.P.M. On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs. Operations Research Letters 20 (1997) 7-13
11. Wolsey L.A. Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation. Management Science 48 12 (2002) 1587-1602