On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs

Journal of Scheduling

Volumn 12, Issue 1, 2009, Pages 91-97

  Fu, Ruyan ^a   Tian, Ji ^a   Yuan, Jinjiang ^a  

^a ZHENGZHOU UNIVERSITY   (China)

Author keywords

Batch machine; Competitive ratio; Job families; On line scheduling

Indexed keywords

BATCH MACHINE; COMPETITIVE RATIO; JOB FAMILIES; MAKESPAN; ON-LINE ALGORITHMS; ON-LINE SCHEDULING;

SCHEDULING;

EID: 60349107276     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-008-0084-6     Document Type: Article

References (18)

1. M. Azizoglu S. Webster 2001 Scheduling a batch processing machine with incompatible job families Computers Industrial Engineering 39 325 335
2. P. Brucker A. Gladky H. Hoogveen M. Y. Kovalyov C. N. Potts T. Tautenhahn S. van de Velde 1998 Scheduling a batching machine Journal of Scheduling 1 31 54
3. X. T. Deng C. K. Poon Y. Z. Zhang 2003 Approximation algorithms in batch processing Journal of Combinatorial Optimization 7 247 257
4. R. Y. Fu J. Tian J. J. Yuan C. He 2008 On-line scheduling on a batch machine to minimize makespan with limited restarts Operations Research Letters 36 255 258
5. S. G. Koh P. H. Koo D. C. Kim W. S. Hur 2005 Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families International Journal of Production Economics 98 81 96
6. Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1993). Sequencing and scheduling: algorithms and complexity. In Handbooks of operations research : Vol. 4. Logistic for production and inventory. Amsterdam: North-Holland.
7. C. Y. Lee R. Uzsoy 1999 Minimizing makespan on a single batch processing machine with dynamic job arrivals International Journal of Production Research 37 219 236
8. C. Y. Lee R. Uzsoy L. A. Martin-Vega 1992 Efficient algorithms for scheduling semiconductor burn-in operations Operations Research 40 764 775
9. S. G. Li G. J. Li X. Q. Qi 2006 Minimizing total weighted completion time on identical parallel batch machines International Journal of Foundations of Computer Science 17 6 1441 1454
10. Q. Q. Nong J. J. Yuan R. Y. Fu L. Lin J. Tian 2008 The single-machine parallel-batching on-line scheduling problem with family jobs to minimize makespan International Journal of Production Economics 111 435 440
11. C. K. Poon W. C. Yu 2005 On-line scheduling algorithms for a batch machine with finite capacity Journal of Combinatorial Optimization 9 167 186
12. C. K. Poon P. X. Zhang 2004 Minimizing makespan in batch machine scheduling Algorithmica 39 155 174
13. C. N. Potts M. Y. Kovalyov 2000 Scheduling with batching: a review European Journal of Operational Research 120 228 249
14. R. Uzsoy 1995 Scheduling batch processing machines with incompatible job families International Journal of Production Research 33 2685 2708
15. J. J. Yuan Z. H. Liu C. T. Ng T. C. E. Cheng 2004 The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan Theoretical Computer Science 320 199 212
16. Yuan, J. J., Fu, R. Y., Ng, C. T., & Cheng, T. C. E. (2007, in submission). A best on-line algorithm for unbounded parallel batch scheduling to minimize makespan with restarts.
17. G. C. Zhang X. Q. Cai C. K. Wong 2001 On-line algorithms for minimizing makespan on batch processing machines Naval Research Logistics 48 241 258
18. G. C. Zhang X. Q. Cai C. K. Wong 2003 Optimal on-line algorithms for scheduling on parallel batch processing machines IIE Transactions 35 175 181