Discrete lot-sizing and scheduling problem: complexity and modification for batch availability

European Journal of Operational Research

Volumn 124, Issue 3, 2000, Pages 511-528

  Brüggemann, Wolfgang ^a   Jahnke, Hermann ^b  

^a UNIVERSITY OF HAMBURG   (Germany)

^b BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AVAILABILITY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DECISION MAKING; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PRODUCTION CONTROL; SCHEDULING; SIMULATED ANNEALING;

BATCH AVAILABILITY; DISCRETE LOT SIZING PROBLEM;

OPERATIONS RESEARCH;

EID: 0343878239     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00190-3     Document Type: Article

References (34)

1. Banker R.D., Datar S.M., Kekre S. Relevant costs, congestion and stochasticity in production environments. Journal of Accounting and Economics. 10:1988;171-197.
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., Fischer, K., Jahnke, H., 1999. Problems - Models - Complexity, in preparation.
4. Brüggemann, W., Jahnke, H., 1993. DLSP for multi-item batch production. In: Fandel, G., Gulledge, Th., Jones, A. (Eds.), Operations Research in Production Planning and Control, Proceedings of a Joint German/US Conference, Hagen, 25-26 June, 1992, pp. 459-472.
5. Brüggemann W., Jahnke H. Remarks on: "Some extensions of the discrete lotsizing and scheduling problem" Management Science. 43:1997;122.
6. Cattrysse D., Salomon M., Kuik R., Van Wassenhove L.N. A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup times. Management Science. 39:1993;477-486.
7. Chen, W.-H., Thizy, J.-M., 1990. Analysis of relaxations for the multi-item capacitated lot-sizing problem. In: Queyranne, M., Mazzola, J.B. (Eds.). Production Planning and Scheduling, Annals of Operations Research 26, pp. 29-72.
8. Černý, V., 1985. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Application 45, 41-51.
9. Collins N.E., Eglese R.W., Golden B.L. Simulated annealing - an annotated bibliography. American Journal of Mathematical and Management Sciences. 8:1988;209-307.
10. Dinkelbach, W. 1964. Zum Problem der Produktionsplanung in Ein- und Mehrproduktunternehmen, Würzburg, Wien, 1964.
11. Dobson G., Karmarkar U.S., Rummel J.L. Batching to minimize flow times on one machine. Management Science. 33:1987;784-799.
12. Drexl, A., Haase, K., 1992. A new type of model for multi-item capacitated dynamic lotsizing and scheduling, Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel Nr. 286, Kiel.
13. Fleischmann B. The discrete lot-sizing and scheduling problem. European Journal of Operational Research. 44:1990;337-348.
14. Fleischmann B. The discrete lot-sizing and scheduling problem with sequence-dependent setup costs. European Journal of Operational Research. 75:1994;395-404.
15. Fleischmann, B., Popp, T., 1989. Das dynamische Losgrößenproblem mit reihenfolgeabhängigen Rüstkosten, In: Operations Research Proceedings 1988, Heidelberg, pp. 510-515.
16. Garey M.R., Johnson D.S. Strong NP-completeness results: Motivation, examples, and implications. Journal of the Association for Computing Machinery. 25:1978;499-508.
17. Garey, M.R., Johnson, D.S., 1979. Computers and Intractability - A Guide to the Theory of NP-Completeness, New York.
18. Glassey C.R. Minimum change-over scheduling of several products on one machine. Operations Research. 16:1968;342-352.
19. Kirkpatrick S., Gelatt C.D., Vecchi M.P. Optimization by simulated annealing. Science. 220:1983;671-680.
20. Kroon, L.G., Salomon, M., 1988. On the complexity of the discrete lot sizing and scheduling problem, Management Report Series 26, Erasmus Universiteit, Rotterdam.
21. Lasdon L.S., Terjung R.C. An efficient algorithm for multi-item scheduling. Operations Research. 19:1971;946-969.
22. Metropolis N., Rosenbluth A.W., Rosenbluth M.N., Teller A.H., Teller E. Equation of state calculations by fast computing machines. The Journal of Chemical Physics. 21:1953;1087-1092.
23. Potts C.N., Van Wassenhove L.N. Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity. Journal of the Operational Research Society. 43:1992;395-406.
24. Salomon, M. 1991. Deterministic Lotsizing Models for Production Planning, Berlin.
25. Salomon M., Kroon L.G., Kuik R., Van Wassenhove L.N. Some extensions of the discrete lotsizing and scheduling problem. Management Science. 37:1991;801-812.
26. Salomon M., Solomon M.M., Van Wassenhove L.N., Dumas Y., 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.
27. Santos C., Magazine M. Batching in single operation manufacturing systems. Operations Research Letters. 4:1985;99-103.
28. Schrage, L. 1981. The multiproduct lot scheduling problem. In: Dempster, M.A.H., Lenstra, J.K., Rinnooy Kan, A.H.G. (Eds.), Deterministic and Stochastic Scheduling, Kluwer, Dordrecht, pp. 233-244.
29. Silver, E.A., Pyke, D.F., Peterson, R., 1988. Inventory Management and Production Planning and Scheduling, 3rd ed., New York.
30. Van Hoesel S., Kuik R., Salomon M., Van Wassenhove L.N. The single-item discrete lotsizing and scheduling problem: optimization by linear and dynamic programming. Discrete Applied Mathematics. 48:1994;289-303.
31. Van Laarhoven, P.J.M. 1988. Theoretical and Computational Aspects of Simulated Annealing, Ph.D. thesis, Erasmus Universiteit, Rotterdam.
32. Van Laarhoven P.J.M., Aarts E., Lenstra J. Job shop scheduling by simulated annealing. Operations Research. 40:1992;113-125.
33. Webster S., Baker K.R. Scheduling groups of jobs on a single machine. Operations Research. 43:1995;692-703.
34. Webster, S. 1999. Remarks on: "Some extensions of the discrete lotsizing and scheduling problem", accepted for publication in Management Science 1999.