Simultaneous lotsizing and scheduling by combining local search with dual reoptimization

European Journal of Operational Research

Volumn 120, Issue 2, 2000, Pages 311-326

  Meyr, H ^a  

^a UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COST EFFECTIVENESS; HEURISTIC METHODS; INTEGER PROGRAMMING; INVENTORY CONTROL; MATHEMATICAL MODELS; OPTIMIZATION; PRODUCTION CONTROL; SCHEDULING; SIMULATED ANNEALING;

DUAL REOPTIMIZATION ALGORITHM; INVENTORY HOLDING COST; LOTSIZING; SEQUENCE DEPENDENCE SET UP COST;

CONCURRENT ENGINEERING;

EID: 0033903519     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00159-9     Document Type: Article

References (35)

1. Ali A.I., Helgason R.V., Kennington J.L., Lall H.S. Primal simplex network codes: State-of-the-art implementation technology. Networks. 8:1978;315-339.
2. Ali A.I., Padman R., Thiagarajan H. Dual algorithms for pure network problems. Operations Research. 37(1):1989;159-171.
3. Bahl H.C., Ritzman L.P., Gupta J.N.D. Determinig lot sizes and resource requirements: A review. Operations Research. 35(3):1987;329-345.
4. T. Baker, J.A. Muckstadt Jr, The CHES problems, Technical Paper, Chesapeake Decision Sciences, Inc., Providence, NJ, 1989.
5. D.P. Bertsekas, Linear Network Optimization, 2nd ed., MIT Press, Cambridge, MA, 1992.
6. D.P. Bertsekas, P. Tseng, RELAX-IV: A faster version of the relax code for solving minimum cost flow problems, Technical Paper, Department of Electrical Engineering and Computer Science, M.I.T., Cambridge, MA, 1994.
7. Bradley G.H., Brown G.G., Graves G.W. Design and implementation of large scale primal transshipment algorithms. Management Science. 24(1):1977;1-34.
8. Campbell G.M. Using short-term dedication for scheduling multiple products on parallel machines. Production and Operations Management. 1(3):1992;295-307.
9. Cattrysse D., Salomon M., Kuik R., Wassenhove L.N. Van A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup times. Management Science. 39(4):1993;477-486.
10. Matta R.D., Guignard M. Studying the effects of production loss due to setup in dynamic production scheduling. European Journal of Operational Research. 72:1994;62-73.
11. Drexl A., Fleischmann B., Günther H.O., Stadtler H., Tempelmeier H. Konzeptionelle Grundlagen kapazitätsorientierter PPS-systeme. Zeitschrift für betriebswirtschaftliche Forschung. 46(12):1994;1022-1045.
12. Drexl A., Haase K. Proportional lotsizing and scheduling. International Journal of Production Economics. 40:1995;73-87.
13. Drexl A., Kimms A. Lot sizing and scheduling - survey and extensions. European Journal of Operational Research. 99:1997;221-235.
14. Dueck G. New optimization heuristics. Journal of Computational Physics. 104:1993;86-92.
15. Dueck G., Scheuer T. Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics. 90:1990;161-175.
16. Eglese R.W. Simulated annealing: A tool for operational research. European Journal of Operational Research. 46:1990;271-281.
17. Fleischmann B. The discrete lot-sizing and scheduling problem. European Journal of Operational Research. 44:1990;337-348.
18. Fleischmann B. The discrete lot-sizing and scheduling problem with sequence-dependent setup costs. European Journal of Operational Research. 75:1994;395-404.
19. Fleischmann B., Meyr H. The general lotsizing and scheduling problem. OR Spektrum. 19(1):1997;11-21.
20. Glover F., Klingman D., Stutz J. Augmented threaded index method for network optimization. INFOR. 12(3):1974;293-298.
21. Gopalakrishnan M., Miller D.M., Schmidt C.P. A framework for modelling setup carryover in the capacitated lot sizing problem. International Journal of Production Research. 33(7):1995;1973-1988.
22. K. Haase, Lotsizing and Scheduling for Production Planning, vol. 408, Lecture Notes in Economics and Mathematical Systems, Springer, Berlin, 1994.
23. Haase K. Capacitated lot-sizing with sequence dependent setup costs. OR Spektrum. 18:1996;51-59.
24. C. Jordan, Batching and Scheduling, vol. 437, Lecture Notes in Economics and Mathematical Systems, Springer, Berlin, 1996.
25. S. Kang, K. Malik, L. Thomas, Lotsizing and scheduling on parallel machines with sequence-dependent setup costs, Technical Paper, Department of Business Administration, The Catholic University of Korea, Seoul, 1997, pp. 422-743.
26. Kirkpatrick S., Gelatt C.D., Vecchi M.P. Optimization by simulated annealing. Science. 220:1983;671-680.
27. Kuik R., Salomon M., Wassenhove L.N. Van Batching decisions: Structure and models. European Journal of Operational Research. 75:1994;243-263.
28. Kuik R., Salomon M., Wassenhove L.N. Van, Maes J. Linear programming, simulated annealing and tabu search heuristics for lotsizing in bottleneck assembly systems. IIE Transactions. 25(1):1993;62-72.
29. McClain J.O., Thomas L.J., Weiss E.N. Efficient solutions to a linear programming model for production scheduling with capacity constraints and no initial stock. IIE Transactions. 21(2):1989;144-152.
30. Potts C.N., Wassenhove L.N. Van Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity. Journal of the Operational Research Society. 43(5):1992;395-406.
31. Salomon M., Solomon L., Wassenhove L.N. Van, Dumas J., 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 Traveling Salesman Problem with time windows. European Journal of Operational Research. 100:1997;494-513.
32. Smith-Daniels V.L., Smith-Daniels D.E. A mixed integer programming model for lot sizing and sequencing packaging lines in the process industries. IIE Transactions. 18:1986;278-285.
33. Suhl U.H. MOPS - mathematical optimization system. European Journal of Operational Research. 72:1994;312-322.
34. Teghem J., Pirlot M., Antoniadis C. Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem. Journal of Computational and Applied Mathematics. 64:1995;91-102.
35. Wolsey L.A. MIP modelling of changeovers in production planning and scheduling problems. European Journal of Operational Research. 99:1997;154-165.