Sequential-analysis based randomized-regret- methods for lot-sizing and scheduling

Journal of the Operational Research Society

Volumn 47, Issue 2, 1996, Pages 251-265

  Drexl, A ^a   Haase, K ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

Lot sizing; Regret based biased random sampling; Scheduling

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBLEM SOLVING; RANDOM PROCESSES;

LOT SIZING; REGRET BASED BIASED RANDOM SAMPLING;

SCHEDULING;

EID: 0030087385     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.1996.23     Document Type: Article

References (35)

1. A. Drexl and K. Haase (1995) Proportional lotsizing and scheduling. Int. J. Prod. Econ. 40, 73-87.
2. B. Fleischmann (1990) The discrete lot-sizing and scheduling problem. Eur. J. Opl Res. 44, 337-348.
3. B. Fleischmann (1994) The discrete lot-sizing and scheduling problem with sequence-dependent setup costs. Eur. J. Opl Res. 75, 395-404.
4. D. Cattrysse, M. Salomon, R. Kuik and L. N. Van Wassenhove (1993) A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup times. Mgmt Sci. 39, 477-486.
5. M. Salomon, M. M. Solomon, L. N. Van Wassenhove, Y. Dumas and S. Dauzre-Peres (1994) Discrete lotsizing and scheduling with sequence dependent setup times and setup costs. Working Paper, Rotterdam School of Management.
6. M. Salomon, L. G. Kroon, R. Kuik and L. N. Van Wassenhove (1991) Some extensions of the discrete lotsizing and scheduling problem. Mgmt Sci. 37, 801-812.
7. U. S. Karmarkar and L. Schrage (1985) The deterministic dynamic product cycling problem. Opns Res. 33, 326-345.
8. Y. Pochet and L. A. Wolsey (1991) Solving multi-item lot-sizing problems using strong cutting planes. Mgmt Sci. 37, 53-67.
9. K. Haase (1994) Lotsizing and Scheduling for Production Planning. Springer, Berlin.
10. G. M. Campbell and V. A. Mabert (1991) Cyclical schedules for capacitated lot sizing with dynamic demands. Mgmt Sci. 37, 409-427.
11. W.-H. Chen and J.-M. Thizy (1990) Analysis of relaxations for the multi-item capacitated lot-sizing problem. Ann. of Opns Res. 26, 29-72.
12. M. Diaby, H. C. Bahl, M. H. Karwan and S. Zionts (1992) A Lagrangean relaxation approach for very-large-scale capacitated lot-sizing. Mgmt Sci. 38, 1329-1340.
13. G. D. Eppen and R. K. Martin (1987) Solving multi-item capacitated lot-sizing problems using variable redefinition. Opns Res. 35, 832-848.
14. J.-M. Thizy and L. N. Van Wassenhove (1985) Lagrangean relaxation for the multi-item capacitated lot-sizing problem: a heuristic implementation. HE Trans. 17, 308-313.
15. J. J. Carreno (1990) Economic lot scheduling for multiple products on parallel identical processors. Mgmt Sci. 36, 348-358.
16. G. Dobson (1987) The economic lot-scheduling problem: achieving feasibility using time-varying lot sizes. Opns Res. 35, 764-771.
17. S. E. Elmaghraby (1978) The economic lot scheduling problem (ELSP): review and extensions. Mgmt Sci. 24, 587-598.
18. R. Haupt (1989) A survey of priority rule-based scheduling. OR Spektrum 11, 3-16.
19. S. S. Panwalkar and W. Iskander (1977) A survey of scheduling rules. Opns Res. 25,45-61.
20. J. P. Hart and A. W. Shogan (1987) Semi-greedy heuristics: an empirical study. Opns Res. Lett. 6, 107-114.
21. T. A. Feo, M. G. C. Resende and S. H. Smith (1994) A greedy randomized adaptive search procedure for the maximum independent set. Opns Res. 42, 860-878.
22. M. Laguna, T. A. Feo and H. C. Elrod (1994) A greedy randomized adaptive search procedure for the two-partition problem. Opns Res. 42, 677-687.
23. A. Drexl (1991) Scheduling of project networks by job assignment. Mgmt Sci. 37, 1590-1602.
24. R. Kolisch (1995) Project Scheduling Under Resource Constraints—Efficient Heuristics For Several Problem Classes. Physica, Heidelberg.
25. P. S. Dixon and E. A. Silver (1981) A heuristic solution procedure for the multi-term, single-level limited capacity, lot-sizing problem. J. Opns Mgmt 2, 23-39.
26. A. Irle (1990) Sequentialanalyse: Optimale Sequentielle Tests. Teubner, Stuttgart.
27. D. Siegmund (1985) Sequential Analysis, Tests and Confidence Intervals. Wiley, New York.
28. W. W. Trigeiro, L. J. Thomas and J. O. McClain (1989) Capacitated lot sizing with setup times. Mgmt Sci. 35, 353-366.
29. P. J. Billington, J. O. McClain and L. J. Thomas (1986) Heuristics for multilevel lot-sizing with a bottleneck. Mgmt Sci. 32, 989-1006.
30. A. Kimms (1996) Multi-level, single-machine lot sizing and scheduling (with initial inventory). Working Paper, University Kiel (to appear in Eur. J. Opl Res.).
31. R. Kuik and M. Salomon (1990) Multi-level lot-sizing problem: evaluation of a simulated-annealing heuristic. Eur. J. Opl Res. 45, 25-37.
32. R. Kuik, M. Salomon, L. N. Van Wassenhove and J. Maes (1993) Linear programming, simulated annealing and tabu search heuristics for lot-sizing in bottleneck assembly systems. HE Trans. 25, 62-72.
33. J. Maes, J. O. McClain and L. N. Van Wassenhove (1991) Multilevel capacitated lotsizing complexity and LP-based heuristics. Eur. J. Opl Res. 53, 131-148.
34. Y. Roll and R. Karni (1991) Multi-item, multi-level lot sizing with an aggregate capacity constraint. Eur. J. Opl Res. 51, 73-87.
35. H. Tempelmeier and S. Helber (1994) A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures. Eur. J. Opl Res. 75, 296-311.