Proportional lot sizing and scheduling: Some extensions

Networks

Volumn 32, Issue 2, 1998, Pages 85-101

  Kimms, A ^a   Drexl, A ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

Multilevel lot sizing; PLSP; Precedence networks; Random sampling; Scheduling

Indexed keywords

EID: 0041175224     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199809)32:2<85::AID-NET2>3.0.CO;2-E     Document Type: Article

References (38)

1. A. Aggarwal and J. K. Park, Improved algorithms for economic lot-size problems. Oper. Res. 41 (1993) 549-571.
2. G. R. Bitran and H. Matsuo, Approximation formulations for the single-product capacitated lot size problem. Oper. Res. 34 (1986) 63-74.
3. M. Diaby, H. C. Bahl, M. H. Karwan, and S. Zionts, A Lagrangean relaxation approach for very-large-scale capacitated lot-sizing. Mgmt. Sci. 38 (1992) 1329-1340.
4. W. Dinkelbach, Zum Problem der Produktionsplanung in Einund Mehrproduktunternehmen, 2nd ed. Physica, Würzburg (1964).
5. A. Drexl, Scheduling of project networks by job assignment. Mgmt. Sci. 37 (1991) 1590-1602.
6. A. Drexl and J. Grünewald, Nonpreemptive multi-mode resource-constrained project scheduling. IIE Trans. 25(5) (1993) 74-81.
7. A. Drexl and K. Haase, Proportional lotsizing and scheduling. Int. J. Prod. Econ. 40 (1995) 73-87.
8. A. Drexl and A. Kimms, Lot sizing and scheduling: Survey and extensions. Eur. J. Oper. Res. 99 (1997) 221-235.
9. S. E. Elmaghraby, A note on the 'explosion' and 'netting' problems in the planning of materials requirements. Oper. Res. 11 (1963) 530-535.
10. G. D. Eppen and R. K. Martin, Solving multi-item capacitated lot-sizing problems using variable redefinition. Oper. Res. 35 (1987) 832-848.
11. J. R. Evans, An efficient implementation of the Wagner-Whitin algorithm for dynamic lot-sizing. J. Oper. Mgmt. 5 (1985) 229-235.
12. A. Federgruen and M. Tzur, A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(n log n) or O(n) time. Mgmt. Sci. 37 (1991) 909-925.
13. T. A. Feo, M. G. C. Resende, and S. H. Smith, A greedy randomized adaptive search procedure for maximum independent set. Oper. Res. 42 (1994) 860-878.
14. B. Fleischmann, The discrete lot-sizing and scheduling problem. Eur. J. Oper. Res. 44 (1990) 337-348.
15. K. Haase, Capacitated lot-sizing with linked production quantities of adjacent periods. Working Paper No. 334, University of Kiel (1993).
16. K. Haase, Lotsizing and Scheduling for Production Planning. Lecture Notes in Economics and Mathematical Systems, Vol. 408. Springer, Berlin (1994).
17. K. Haase and A. Kimms, Lot sizing and scheduling with sequence dependent setup costs and times and efficient rescheduling opportunities. Working Paper No. 393, University of Kiel (1996).
18. K. S. Hindi, Solving the CLSP by a Tabu search heuristic. J. Oper. Res. Soc. 47 (1996) 151-161.
19. U. S. Karmarkar, S. Kekre, and S. Kekre, The deterministic lotsizing problem with startup and reservation costs. Oper. Res. 35 (1987) 389-398.
20. U. S. Karmarkar and L. Schrage, The deterministic dynamic product cycling problem. Oper. Res. 33 (1985) 326-345.
21. A. Kimms, Optimal multi-level lot sizing and scheduling with dedicated machines. Working Paper No. 351, University of Kiel (1994).
22. A. Kimms, Multi-level, single-machine lot sizing and scheduling (with initial inventory). Eur. J. Oper. Res. 89 (1996) 86-99.
23. A. Kimms, Competitive methods for multi-level lot sizing and scheduling: Tabu search and randomized regrets. Int. J. Prod. Res. 34 (1996) 2279-2298.
24. A. Kimms, Demand shuffle - A method for multi-level proportional lot sizing and scheduling. Nav. Res. Log. 44 (1997) 319-340.
25. A. Kimms, Multi-Level Lot Sizing and Scheduling - Methods for Capacitated, Dynamic, and Deterministic Models. Heidelberg, Physica (1997).
26. Ö. Kirca and M. Kökten, A new heuristic approach for the multi-item dynamic lot sizing problem. Eur. J. Oper. Res. 75 (1994) 332-341.
27. L. S. Lasdon and R. C. Terjung, An efficient algorithm for multi-item scheduling. Oper. Res. 19 (1971) 946-969.
28. V. Lotfi and W. H. Chen, An optimal algorithm for the multi-item capacitated production planning problem. Eur. J. Oper. Res. 52 (1991) 179-193.
29. J. Maes and L. N. Van Wassenhove, Multi-item single-level capacitated dynamic lot-sizing heuristics: A general review. J. Oper. Res. Soc. 39 (1988) 991-1004.
30. M. Salomon, L. G. Kroon, R. Kuik, and L. N. Van Wassenhove, Some extensions of the discrete lotsizing and scheduling problem. Mgmt. Sci. 37 (1991) 801-812.
31. H. Stadtler, Mixed integer programming model formulations for dynamic multi-item multi-level capacitatec lotsizing. Eur. J. Oper. Res. 94 (1996) 561-581.
32. H. Tempelmeier and M. Derstroff, A Lagrangean-based heuristic for dynamic multi-level multi-item constrained lotsizing with setup times. Mgmt. Sci. 42 (1996) 738-757.
33. H. Tempelmeier and S. Helber. A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures. Eur. J. Oper. Res. 75 (1994) 296-311.
34. G. L. Thompson, On the parts requirement problem. Oper. Res. 13 (1965) 453-461.
35. S. Van Hoesel and A. Kolen, A linear description of the discrete lot-sizing and scheduling problem. Eur. J. Oper. Res. 75 (1994) 342-353.
36. A. Vazsonyi, Scientific Programming in Business and Industry. Wiley, New York (1958).
37. A. Wagelmans, S. Van Hoesel, and A. Kolen, Economic lot sizing: An O(n log n) algorithm that runs in linear time in the Wagner-Whitin case. Oper. Res. 40 (1992) S145-S156.
38. H. M. Wagner and T. M. Whitin, Dynamic version of the economic lot size model. Mgmt. Sci. 5 (1958) 89-96.