On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan

European Journal of Operational Research

Volumn 189, Issue 3, 2008, Pages 1327-1342

  Ridouard, Frédéric ^a   Richard, Pascal ^a   Martineau, Patrick ^b  

^a ENSMA   (France)

^b UNIVERSITÉ DE TOURS   (France)

Author keywords

Batch processing machine; Competitive analysis; On line scheduling

Indexed keywords

OPERATIONS RESEARCH; PROBLEM SOLVING; PROCESS ENGINEERING; SCHEDULING ALGORITHMS;

BATCH PROCESSING MACHINES; ON-LINE SCHEDULING;

SCHEDULING;

EID: 40849100079     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.06.080     Document Type: Article

References (19)

1. Baptiste P. Batching identical jobs. Mathematics Methods of Operations Research 53 (2000) 355-367
2. Brucker P., Gladky A., Hoogoveen H., Kovalyov M.K., Potts C., Tautenhahn T., and VanDeVelde S. Scheduling a batching machine. Journal of Scheduling 1 1 (1998) 31-58
3. Brucker P. Scheduling Algorithms (2001), Springer Verlag
4. Borodin A., and El-Yaniv R. Online Computation and Competitive analysis (1998), Cambridge University Press
5. Cheng T.C.E., Liu Z., and Yu W. Scheduling jobs with release dates and deadlines on a batch processing machines. IIE Transactions 33 (2001) 685-690
6. Cheng T.C.E., Yan J.J., and Yang A.F. Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times. Computer and Operations Research 32 (2004) 849-859
7. Dupont L., and Dhaenens-Flipo C. Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure. Computer and Operations Research 29 7 (2002) 807-819
8. Ikura Y., and Gimple M. Efficient scheduling algorithms for a single batch processing machine. Operations Research Letters 5 (1986) 61-65
9. Lee C.Y., and Uzsoy R. Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research 37 1 (1999) 219-236
10. Lee C.Y., Uzsoy R., and Martin-Vega L.A. Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research 40 (1992) 219-236
11. Liu Z., and Yu W. Scheduling one batch processor subject to job release dates. Discrete Applied Mathematics 105 (2000) 129-136
12. Potts C., and Kovalyov M.K. Scheduling with batching: A review. European Journal of Operational Research 120 2 (2000) 228-249
13. Poon C.K., and Yu W. A flexible on-line scheduling algorithms for batch machine with infinite capacity. Annals of Operations Research 133 (2005) 175-181
14. Poon C.K., and Yu W. On-line scheduling algorithms for a batch machine with finite capacity. Journal of Combinatorial Optimization 9 2 (2005) 167-186
15. Poon C.K., and Zhang P. Minimizing makespan in batch machine scheduling. Proc Int. Symposium on Algorithms and Computations (ISAAC 2000). Lecture Notes in Computer Science (2000), Springer Verlag 386-397 (LNCS 1969)
16. F. Ridouard, P. Richard, P. Martineau, On-line minimization of makespan for single batching machine scheduling problems. in: 9th International Workshop on Project Management and Scheduling (PMS'04), 2004, pp. 287-290.
17. Sung C.S., and Choung Y.I. Minimizing makespan on a single burn-in oven in semiconductor manufacturing. European Journal of Oerational Research 120 (2000) 559-574
18. Uzsoy R., Lee C.Y., and Martin-Vega L.A. A review of production planning and scheduling models in the semiconductor industry, part i:system characteristics, performance evaluation and production planning. IEE Transactions on Scheduling and Logistics 26 (1992) 44-55
19. Zhang G., Cai X., and Wong C.K. On-line algorithms for minimizing makespan on batch processing machines. Naval Research Logistics 48 (2001) 241-258