Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops

INFORMS Journal on Computing

Volumn 13, Issue 2, 2001, Pages 120-137

  Glass, C A ^a   Potts, C N ^b   Strusevich, V A ^c  

^a CITY UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^c UNIVERSITY OF GREENWICH   (United Kingdom)

Author keywords

Analysis of Algorithms; Computational Complexity; Flow shop; Open shop; Production scheduling; Suboptimal Algorithms

Indexed keywords

EID: 0346452841     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.13.2.120.10521     Document Type: Article

References (21)

1. Albers, S., P. Brucker. 1993. The complexity of one-machine batching problems. Discrete Applied Mathematics 47 87-107.
2. Brucker, P., M.Y. Kovalyov. 1996. Single machine batch scheduling to minimize the weighted number of late jobs. Mathematical Methods of Operations Research 43 1-8.
3. Cheng, T.C.E., Z.-L. Chen, M.Y. Kovalyov, B.M.T. Lin. 1996. Parallel-machine batching and scheduling to minimize total completion time. IIE Transactions 28 953-956.
4. Cheng, T.C.E., M.Y. Kovalyov. 1998a. Single machine batch scheduling with sequential job processing. Annual Research Report, Departement of Management, Polytechnic University, Hong Kong.
5. Cheng, T.C.E., M.Y. Kovalyov. 1998b. Algorithms for parallel machine batch scheduling with deadlines. Annual Research Report, Departement of Management, Polytechnic University, Hong Kong.
6. Cheng, T.C.E., G. Wang. 1998. Batching and scheduling to minimize the makespan in the two-machine flowshop. IIE Transactions 30 447-453.
7. Garey, M.R., D.S. Johnson. 1979. Computers and Intractability. A Guide to The Theory of NP-Completeness. Freeman, San Francisco, CA.
8. Gonzalez, T., S. Sahni. 1976. Open-shop schedules to minimize finish time. Journal of the Association for Computing Machinery 23 665-679.
9. Graham, R.E. 1969. Bounds on multiprocessing timing anomalies. SIAM journal on Applied Mathematics 17 416-429.
10. Graham, R.L. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan. 1979. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5 287-326.
11. Hochbaum D.S., D. Landy. 1994. Scheduling with batching: minimizing the weighted number of tardy jobs. Operations Research Letters 16 79-86.
12. Johnson, S.M. 1954. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 61-68.
13. Karp, R.M. 1972. Reducibility among combinatorial problems. R.E. Miller and J.W. Thatcher, eds. Complexity of Computer Computations, Plenum Press, New York. 85-103.
14. Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys. 1993. Sequencing and scheduling: algorithms and complexity. S.C. Graves, A.H.G. Rinnooy Kan, P.H. Zipkin, eds. Handbooks in Operations Research and Management Science, Volume 4, Logistics of Production and Inventory, North-Holland, Amsterdam, The Netherlands. 455-522.
15. Potts, C.N. 1985. Analysis of a linear-programming heuristic for scheduling unrelated parallel machines. Discrete Applied Mathematics 10 155-164.
16. Potts, C.N., V.A. Strusevich, T. Tautenhahn. 1998. Shop scheduling with batching machines. Preprint OR100, Faculty of Mathematical Studies, Southampton University, U.K.
17. Rothkopf, M.H. 1966. Scheduling independent tasks on parallel processors. Management Science 12 437-447.
18. Sahni, S. 1976. Algorithms for scheduling independent tasks, journal of the Association for Computing Machinery 23 116-127.
19. Strusevich, V.A. 1993. Two-machine open-shop scheduling problem with setup, processing and removal times separated. Computers & Operations Research 20 597-611.
20. Webster, S., K.R. Baker. 1995. Scheduling groups of jobs on a single machine. Operations Research 43 692-703.
21. Yoshida, T., K. Hitomi. 1979. Optimal two-stage production scheduling with setup times separated. AIIE Transactions 11 261-263.