Problems, Models and Complexity. Part II: Application to the DLSP

Journal of Mathematical Modelling and Algorithms

Volumn 2, Issue 2, 2003, Pages 153-169

  Bruggemann W ^a   Fischer, K ^b   Jahnke, H ^c  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b ASTON UNIVERSITY   (United Kingdom)

^c BIELEFELD UNIVERSITY   (Germany)

Author keywords

DLSP; philosophy of modeling; problem complexity; production planning

Indexed keywords

EID: 84888587257     PISSN: 15701166     EISSN: 15729214     Source Type: Journal    
DOI: 10.1023/A:1024979501350     Document Type: Article

References (24)

1. Bowman, E. H. (1959) The schedule-sequencing problem, Oper. Res. 7, 621-624.
2. Brüggemann, W. (1995) Ausgewählte Probleme der Produktionsplanung - Modellierung, Komplexität und neuere Lösungsmöglichkeiten, Physica-Verlag, Heidelberg.
3. Brüggemann, W. and Jahnke, H. (1994) Remarks on: 'some extensions of the discrete lotsizing and scheduling problem' by M. Salomon, L. G. Kroon, R. Kuik and L. N. van Wassenhove, In: Management Sci. 37(7) (1991), 801-812. Working Paper, Institut für Logistik und Transport, Universität Hamburg. Superseded by Brüggemann and Jahnke (1997).
4. Brüggemann, W. and Jahnke, H. (1997) Remarks on: 'some extensions of the discrete lotsizing and scheduling problem', Management Sci. 43(1), 122.
5. Brüggemann, W. and Jahnke, H. (2000) The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability, Europ. J. Oper. Res. 124(3), 511-528.
6. Brüggemann, W., Fischer, K. and Jahnke, H. (2003) Problems, models and complexity. Part I: Theory, J. Math. Modelling Algorithms2 (2003), 121-151 (this issue).
7. Cattrysse, D., Salomon, M., Kuik, R. and van Wassenhove, L. N. (1993) A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup times, Management Sci. 39(4), 477-486.
8. Dinkelbach, W. (1964) Zum Problem der Produktionsplanung in Ein-und Mehrproduktunternehmen, Physica-Verlag, Würzburg.
9. Drexl, A. and Kimms, A. (1997) Lot sizing and scheduling - survey and extensions, Europ. J. Oper. Res. 99, 221-235.
10. Fleischmann, B. (1990) The discrete lot-sizing and scheduling problem, Europ. J. Oper. Res. 44, 337-348.
11. Fleischmann, B. (1994) The discrete lot-sizing and scheduling problem with sequence-dependent setup costs, Europ. J. Oper. Res. 75, 395-404.
12. Garey, M. R. and Johnson, D. S. (1978) 'strong' NP-completeness results: Motivation, examples, and implications, J. Assoc. Comput. Mach. 25, 499-508.
13. Garey, M. R. and Johnson, D. S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York.
14. Jordan, C. (1996) Batching and Scheduling - Models and Methods for Several Problem Classes, Springer, Berlin.
15. Jordan, C. (1998) A two-phase genetic algorithm to solve variants of the batch sequencing problem, Internat. J. Prod. Res. 36(3), 745-760.
16. Jordan, C. and Drexl, A. (1995) A comparison of constraint and mixed-integer programming solvers for batch sequencing with sequence-dependent setups, ORSA J. Comput. 7(2), 160-165.
17. Jordan, C. and Drexl, A. (1998) Discrete lotsizing and scheduling by batch sequencing, Management Sci. 44(5), 698-713.
18. Jordan, C. and Koppelmann, J. (1998) Multi-level lotsizing and scheduling by batch sequencing, J. Oper. Res. Soc. 49, 1212-1218.
19. Magnanti, T. L. and Vachani, R. (1990) A strong cutting plane algorithm for production scheduling with changeover costs, Oper. Res. 38(3), 456-473.
20. Manne, A. S. (1960) On the job-shop scheduling problem, Oper. Res. 8(2), 219-223.
21. Salomon, M. (1991) Deterministic Lotsizing Models for Production Planning, Springer-Verlag, Berlin.
22. Salomon, M., Kroon, L. G., Kuik, R. and van Wassenhove, L. N. (1991) Some extensions of the discrete lotsizing and scheduling problem, Management Sci. 37, 801-812.
23. Türck, H. (1997) Das diskrete simultane Losgröß en-und Losreihenfolgeproblem, Diplom-Thesis (in German), Universität Hamburg.
24. Webster, S. (1999) Remarks on 'some extensions of the discrete lotsizing and scheduling problem', Management Sci. 45, 768-769.