Competitive methods for multi-level lot sizing and scheduling: Tabu search and randomized regrets

International Journal of Production Research

Volumn 34, Issue 8, 1996, Pages 2279-2298

  Kimms, A ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

MULTILEVEL SINGLE MACHINE LOT SIZING; RANDOMIZED REGRET BASED HEURISTIC; TABU SEARCH METHOD;

PRODUCTION CONTROL;

EID: 0030215744     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207549608905025     Document Type: Article

References (35)

1. Andler, K., 1929, Rationalisierung der Fabrikation und optimale Losgröße (München: Oldenbourg).
2. Afentakis, P-, Gavish, B., 1986, Optimal lot-sizing algorithms for complex product structures. Operations Research, 34, 237-249.
3. Bahl, H. C., Ritzman, L. P., and Gupta, J. N. D., 1987, Determining lot sizes and resource requirements: a review. Operations Research, 35, 329-345.
4. Balas, E., 1969, Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Operations Research, 17, 941-957.
5. Bollobäs, B., 1979, Graph theory-an introductory course (Springer: New York).
6. Brüggemann, W., and Jahnke, H., 1994, DLSP for 2-stage multi-item batch production. International Journal of Production Research, 32, 755-768.
7. DellAmico, M., and Trubian, M., 1993, Applying tabu-search to the job-shop scheduling problem. Annals of Operations Research, 41, 231-252.
8. Domschke, W., Scholl, A., and Voo, S., 1993, Produktionsplanung-Ablauforganisatorische Aspekte (Springer: Heidelberg).
9. Drexl, A., 1991, Scheduling of project networks by job assignment. Management Science, 37, 1590-1602.
10. Drexl, A., and 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, no. 286
11. Drexl, A., Haase, K., and Kimms, A., 1995, Losgrößen- and Ablaufplanung in PPS-Systemen auf der Basis randomisierter Opportunitätskosten. Zeitschrift für Betriebswirtschaft, 65, 267-285.
12. El-Najdawi, M. K. and Kleindorfer, P. R., 1993, Common cycle lot-size scheduling for multiproduct, multi-stage production. Management Science, 39, 872-885.
13. Faigle, U., and Kern, W., 1992, Some convergence results for probabilistic tabu search. ORSA Journal on Computing, 4, 32-37.
14. Glover, F., Tabu search-Part I. ORSA Journal on Computing, 1, 190-206.
15. Glover, F., Tabu search-Part II. ORSA Journal on Computing, 2, 4-32.
16. Glover, F., 1994, Tabu search fundamentals and uses. Working Paper, University of Colorado.
17. Haase, K., 1994, Lotsizing and scheduling for production planning. Lecture notes in Economics and Mathematical systems. 408 (Springer: Berlin).
18. Harris, F. W., 1913, How many parts to make at once. Factory, The Magazine of Management, 10, 135-136, 152. Reprinted 1990, in Operations Research 38, 947-950.
19. Helber, S., 1994, Kapazitätsorientierte Losgrößenplanung in PPS-Systemen. PhD thesis, University of Munich, Stuttgart, M&P.
20. Hertz, A., and de Werra, D., 1990, The tabu search metaheuristic: how we used it. Annals of Mathematics and Artificial Intelligence, 1, 111-121.
21. Iyogun, P., and Atkins, D., 1993, A lower bound and an efficient heuristic for multistage multiproduct distribution systems. Management Science, 39, 204-217
22. Kimms, A., 1993a, Multi-level, single-machine lot sizing and scheduling (with initial inventory). Manuskripte aus den Instituten für Betriebswritschaftslehre der Universität Kiel, no. 329. European Journal of Operational Research, in press.
23. Kimms, A., 1993b, A cellular automaton based heuristic for multi-level lot sizing and scheduling. Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel, no. 331.
24. Kuik, R., and Salomon, M., 1990, Multi-level lot-sizing problem: evaluation of a simulated-annealing heuristic. European Journal of Operational Research, 45, 25-37.
25. Kuik, R., Salomon, M., van Wassenhove, L. N., and Maes, J., 1993, Linear programming, simulated annealing and tabu search heuristics for lotsizing in bottleneck assembly systems. HE Transactions, 25, (1), 12-62.
26. Maes, J., McClain, J. O., van Wassenhove, L. N., 1991, Multilevel capacitated lotsizing complexity and LP-based heuristics. European Journal of Operational Research, 53, 131-148.
27. Nowicki, E., and Smutnicki, C., 1993, A fast taboo search algorithm for the job shop problem. Working paper, Instytut Cybernetyki Technicznej Politechniki Wroclawskiej.
28. Roll, Y., and Karni, R., 1991, Multi-item, multi-level lot sizing with an aggregate capacity constraint. European Journal of Operational Research, 51, 73-87.
29. Roundy, R. O., 1993, Efficient, effective lot sizing for multistage production systems. Operations Research, 41, 371-385.
30. Salomon, M., 1991, Deterministic lot sizing models for production planning. Lecture Notes in Economics and Mathematical Systems, 355, (Springer: Berlin).
31. Salomon, M., Kujk, R., and van Wassenhove, L. N, 1993, Statistical search methods for lotsizing problems. Annals of Operations Research, 41, 453-468.
32. Schräge, L., 1991, LINDO User’s Manual for Linear, Integer and Quadratic programming Release 5.0 (New York: Scientific Press).
33. Stadtler, H., 1994, Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing. Working Paper, University of Darmstadt.
34. Tempelmeier, H., 1995, Material-Logistik-Grundlagen der Bedarfs- und Losgrößenplanung in PPS-Systemen, 3rd edn (Springer: Berlin).
35. Tempelmeier, H., and Derstroff, M., 1993, Mehrstufige Mehrprodukt-Losgrößenplanung bei beschränkten Ressourcen und genereller Erzeugnistruktur. OR Spektrum, 15, 63-73.