Online scheduling on unbounded parallel-batch machines to minimize the makespan

Information Processing Letters

Volumn 109, Issue 21-22, 2009, Pages 1211-1215

  Tian, Ji ^a   Cheng, T C E ^b   Ng, C T ^b   Yuan, Jinjiang ^c  

^a CHINA UNIVERSITY OF MINING AND TECHNOLOGY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^c ZHENGZHOU UNIVERSITY   (China)

Author keywords

Algorithms; Competitive ratio; Makespan; Online scheduling; Parallel batch machines

Indexed keywords

ALGORITHM MATCHING; BATCH MACHINES; COMPETITIVE RATIO; LOWER BOUNDS; MAKESPAN; ON-LINE ALGORITHMS; ONLINE SCHEDULING; PARALLEL-BATCH MACHINES; POSITIVE SOLUTION; PROCESSING TIME;

CONTROL THEORY; PARALLEL ALGORITHMS;

SCHEDULING ALGORITHMS;

EID: 70349731959     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2009.08.008     Document Type: Article

References (15)

1. Avramidis A.N., Healy K.J., and Uzsoy R. Control of a batch processing machine: A computational approach. International Journal of Production Research 36 (1998) 3167-3181
2. Brucker P., Gladky A., Hoogeveen H., Kovalyov M.Y., Potts C.N., Tautenhahn T., and van de Velde S.L. Scheduling a batching machine. Journal of Scheduling 1 (1998) 31-54
3. Deng X.T., Poon C.K., and Zhang Y.Z. Approximation algorithms in batch processing. Journal of Combinatorial Optimization 7 (2003) 247-257
4. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., and Shmoys D.B. Sequencing and scheduling: Algorithms and complexity. In: Graves S.C., Zipkin P.H., and Rinnooy Kan A.H.G. (Eds). Logistics of Production and Inventory. Handbooks in Operation Research Management Science vol. 4 (1993), North-Holland, Amsterdam 445-522
5. Tian J., Fu R.Y., and Yuan J.J. A best online algorithm for scheduling on two parallel-batch machines with infinite batch size to minimize makespan. Theoretical Computer Science 410 (2009) 2291-2294
6. Lee C.Y., and Uzsoy R. Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research 37 (1999) 219-236
7. Liu Z., and Yu W.C. Scheduling one batch processor subject to job release date. Discrete Applied Mathematics 105 (2000) 129-136
8. Mathirajan M., and Sivakumar A.I. A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. International Journal of Advanced Manufacturing Technology 29 (2006) 990-1001
9. Nong Q.Q., Cheng T.C.E., and Ng C.T. An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines. Operations Research Letters 36 (2008) 584-588
10. Poon C.K., and Yu W.C. A flexible online scheduling algorithms for batch machine with infinite capacity. Annals of Operations Research 133 (2005) 175-181
11. Poon C.K., and Yu W.C. Online scheduling algorithms for a batch machine with finite capacity. Journal of Combinatorial Optimization 9 (2005) 167-186
12. 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. IIE Transactions on Scheduling and Logistics 24 (1992) 47-61
13. Uzsoy R., Lee C.Y., and Martin-Vega L.A. A survey of production planning and scheduling models in the semiconductor industry, part II: Shop-floor control. IIE Transactions on Scheduling and Logistics 26 (1994) 44-55
14. Zhang G.C., Cai X.Q., and Wong C.K. Online algorithms for minimizing makespan on batch processing machines. Naval Research Logistics 48 (2001) 241-258
15. Zhang G.C., Cai X.Q., and Wong C.K. Optimal online algorithms for scheduling on parallel batch processing machines. IIE Transactions 35 (2003) 175-181