Scheduling batches with simultaneous job processing for two-machine shop problems

Journal of Scheduling

Volumn 4, Issue 1, 2001, Pages 25-51

  Potts, C N ^a   Strusevich, V A ^b   Tautenhahn, T ^c  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b UNIVERSITY OF GREENWICH   (United Kingdom)

^c OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Batching; Flow shop; Job shop; NP hard; Open shop; Polynomial algorithm; Scheduling

Indexed keywords

EID: 0345861143     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/1099-1425(200101/02)4:1<25::AID-JOS58>3.0.CO;2-7     Document Type: Article

References (23)

1. Potts CN, Kovalyov MY. Scheduling with batching: a review. European Journal of Operational Research 2000; 120:228-249.
2. Potts CN, Van Wassenhove LN. Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. Journal of the Operational Research Society 1992; 43:395-406.
3. Webster ST, Baker KR. Scheduling groups of jobs on a single machine. Operations Research 1995; 43:692-703.
4. Albers S, Brucker P. The complexity of one-machine batching problems. Discrete Applied Mathematics 1993; 47:87-107.
5. Brucker P, Kovalyov MY. Single machine batch scheduling to minimize the weighted number of late jobs. Mathematical Methods of Operations Research 1996; 43:1-8.
6. Cheng TCE, Kovalyov MY. Single machine batch scheduling with sequential job processing, 1998 in submission.
7. Coffman Jr. EG, Yannakakis M, Magazine MJ, Santos C. Batch sizing and job sequencing on a single machine. Annals of Operations Research 1990; 26:135-147.
8. Hochbaum DS, Landy D. Scheduling with batching: minimizing the weighted number of tardy jobs. Operations Research Letters 1994; 16:79-86.
9. Glass CA, Potts CN, Strusevich VA. Scheduling batching machines with sequential job processing for flow shops and open shops. INFORMS Journal on Computing, to appear.
10. Ahmadi JH, Ahmadi RH, Dasu S, Tang CS. Batching and scheduling jobs on batch and discrete processors. Operations Research 1992; 39:750-763.
11. Brucker P, Gladky A, Hoogeveen JA, Kovalyov MY, Potts CN, Tautenhahn T, van de Velde SL. Scheduling a batch processing machine. Journal of Scheduling 1998; 1:31-54.
12. Chandru V, Lee C-Y, Uzsoy R. Minimizing total completion time on batch processing machines. International Journal of Production Research 1993; 31:2097-2122.
13. Chandru V, Lee C-Y, Uzsoy R. Minimizing total completion time on a batch processing machine. Operations Research Letters 1993; 13:61-65.
14. Cheng TCE, Kovalyov MY. Addendum to C.-Y. Lee, R. Uzsoy and L.A. Martin-Vega (1992). Working Paper Institute of Engineering Cybernetics, Minsk, Belarus, 1995.
15. Hochbaum DS, Landy D. Scheduling semiconductor burn-in operations to minimize total flowtime. Operations Research 1997; 45:874-885.
16. Lee C-Y, Uzsoy R, Martin-Vega LA. Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research 1992; 40:764-775.
17. Uzsoy R. Scheduling batch processing machines with incompatible job families. International Journal of Production Research 1995; 33:2685-2708.
18. Hoogeveen JA, van de Velde SL. Scheduling by positional completion times: analysis of a two-stage flow shop with a batching machine. Mathematical Programming 1998; 82:273-289.
19. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 1979; 5:287-326.
20. Gonzalez T, Sahni S. Open shop scheduling to minimize finish time. Journal of the Association for Computing Machinery 1976; 23:665-680.
21. Lev V, Adiri I. V-shop scheduling. European Journal of Operational Research 1984; 18:51-56.
22. Gonzalez T, Sahni S. Flowshop and jobshop schedules: complexity and approximation. Operations Research 1978; 26:36-52.
23. Jackson JR. An extension of Johnson's results on job lot scheduling. Naval Research Logistics Quarterly 1956; 3:201-203.