Integrating scheduling with batching and lot-sizing: A algorithms and complexity

Journal of the Operational Research Society

Volumn 43, Issue 5, 1992, Pages 395-406

  Potts, C N ^a   Wassenhove, L N ^b  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b INSEAD   (France)

Author keywords

Algorithms; Batching; Compelexity; Lot sizing; Scheduling

Indexed keywords

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

References (37)

1. I. Ham, K. Hitomi and T. Yoshida(1985)Group Technology: Applications to Production Management.Kluwer-Nijhoff, Boston.
2. K. R. Baker (1990) Lot-sizing procedures and a standard data set: a reconciliation of the literature. J. Manuf. Opns Mgmt2, 199-221.
3. J. Maes and L. N. Van Wassenhove (1988) Multi-item single-level capacitated dynamic lot-sizing heuristics: a general review. J. OpI Res. Soc.39, 991-1004.
4. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. Shmoys (1989) Sequencing and scheduling: algorithms and complexity. Report 8934/A, Econometric Institute, Erasmus University, Rotterdam.
5. J. R. Jackson (1955) Scheduling a production line to minimize maximum tardiness. Research Report 43, Management Science Research Project, University of California, Los Angeles.
6. W. E. Smith (1956) Various optimizers for single-stage production. Naval Res. Logisl. Q.3, 59-66.
7. J. M. Moore (1968) An n job, one machine sequencing algorithm for minimizing the number of late jobs. Mgmt Sci. 15, 102-109.
8. R. W. Conway, W. L. Maxwell and L. W. Miller (1967)Theory of Scheduling. Addison-Wesley, Reading, MA.
9. S. M. Johnson (1954) Optimal two- and three-stage production schedules with setup times included.Naval Res. Logist. Q.1, 61-68.
10. T. Gonzalez and S. Sahni (1976) Open shop scheduling to minimize finish time. J. Assoc. Comput. Mach.23, 665-679.
11. R. M. Karp (1972) Reducibility among combinatorial problems. In Complexity of Computer Computations. (R. E. Miller and J. W. Thatcher, Eds) pp 85-103. Plenum Press, New York.
12. J. Du and J. Y.-T. Leung (1990) Minimizing total tardiness on one machine is NP-hard. Math. Opns Res.15, 483-495.
13. J. K. Lenstra, A. H. G. Rinnooy Kan and P. Brucker (1977) Complexity of machine scheduling problems. Ann. Discrete Math.1, 343-362.
14. J. Bruno, E. G. Coffman,.Jr, and R. Sethi (1974) Scheduling independent tasks to reduce mean finishing time. Comm. ACM17, 382-387.
15. M. R. Garey, D. S. Johnson and R. Sethi (1976) The complexity of flowshop and jobshop scheduling. Math. Opns Res.1, 117-129.
16. J. O. Achugbue and F. Y. Chin (1982) Scheduling the open shop to minimize mean flow time. SIAM J. Comput.11, 709-720.
17. V. K. Sahney (1972) Single-server, two-machine sequencing with switching time. Opns Res.20, 24-36.
18. C. L. Monma and C. N. Potts (1989) On the complexity of scheduling with batch set-up times. Opns Res.37, 798-804.
19. E. L. Lawler (1978) Sequencing to minimize total weighted completion time subject to precedence constraints. Ann. Discrete Math.2, 75-90.
20. E. L. Lawler and J. M. Moore (1969) A functional equation and its application to resource allocation and sequencing problems. Mgmt Sci.16, 77-84.
21. B.-H. Ahn and J.-H. Hyun (1990) Single facility multi-class job scheduling, Computers Opns Res.17, 265-272.
22. K. R. Baker and L. E. Schrage (1978) Finding an optimal sequence by dynamic programming: an extension to precedence-related tasks. Opns Res.26, 111-120.
23. J. Bruno and P. Downey (1978) Complexity of task sequencing with deadlines, set-up times and changeover costs. SIAM J. Comput.7, 393-404.
24. S. Zdrzalka (1991) Approximation algorithms for single machine sequencing with delivery times and unit batch setup times. Eur. J. Opl Res.51, 199-209.
25. A. J. Mason and E. J. Anderson (1991) Minimizing flow time on a single machine with job classes and setup times. Naval Res. Logist.38, 333-350.
26. J. N. D. Gupta (1988) Single facility scheduling with multiple job classes. Eur. J. Opl Res.33, 42-45.
27. K. C. So (1990) Some heuristics for scheduling jobs on parallel machines with setups. Mgmt Sci.36, 467-475.
28. Y. Sekiguchi (1983) Optimal schedule in a GT-type flow-shop under series-parallel precedence constraints. J. Opns Res. Soc. Japan26, 226-251.
29. A. J. Vakharia and Y.-L. Chang (1990) A simulated annealing approach to scheduling a manufacturing cell. Naval Res. Logist.37, 559-577.
30. C. Santos (1984) Batching and sequencing decisions under lead time considerations for single machine problems. MSc Thesis, Department of Management Sciences, University of Waterloo, Waterloo.
31. G. Dobson, U. S. Karmarkar and J. L. Rummel (1987) Batching to minimize flow times on one machine, Mgmt Sci. 33, 784-799.
32. M. Y. Kovalyov, C. N. Potts and L. N. Van Wassenhove (1992) Single machine scheduling with set-ups to minimize the number of late items. Report, Econometric Institute, Erasmus University, Rotterdam.
33. C. Santos and M. Magazine (1985) Batching in single operation manufacturing systems. Opns Res. Lett.4, 99-103.
34. D. Naddef and C. Santos (1988) One-pass batching algorithms for the one machine problem. Discrete Appl. Math. 21, 133-145.
35. C. L. Monma and C. N. Potts (1992) Analysis of heuristics for preemptive parallel machine scheduling with batch setup times. Opns Res.to appear.
36. C. N. Potts and K. R. Baker (1989) Flow shop scheduling with lot streaming. Opns Res. Lett.8, 297-303.
37. K. R. Baker and D. F. Pyke (1990) Solution procedures for the lot-streaming problem. Decis. Sci.21, 475-491.