A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines

Journal of Scheduling

Volumn 15, Issue 1, 2012, Pages 77-81

  Liu, Peihai ^a   Lu, Xiwen ^a   Fang, Yang ^a  

^a EAST CHINA UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

On line; Parallel batch machines; Scheduling

Indexed keywords

BATCH PROCESSING MACHINE; COMPETITIVE RATIO; DETERMINISTIC ONLINE ALGORITHMS; MAKESPAN; MINIMIZING MAKESPAN; ON-LINE; ON-LINE ALGORITHMS; ONLINE SCHEDULING; PARALLEL BATCH; PROCESSING TIME; SPECIFIC VALUES;

BATCH DATA PROCESSING; SCHEDULING;

SCHEDULING ALGORITHMS;

EID: 79953313462     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-009-0154-4     Document Type: Article

References (16)

1. Brucker, P., Gladky, A., Hoogeveen, H., Kovalyvov, M. Y., Potts, C. N., Tautehahn, T., & Velde, S. L. (1998). Scheduling a batching machine. Journal of Scheduling, 1, 31-54. (Pubitemid 128544878)
2. Chen, B., Deng, X., & Zang, W. (2001). On-line scheduling a batch processing system to minimize total weighted job completion time. In Lecture notes in computer science (Vol. 2223, pp. 380-389). Berlin: Springer.
3. Cheng, T. C. E., Ng, C. T., Yuan, J. J., & Liu, Z. H. (2004). Single machine parallel batch scheduling subject to precedence constraints. Naval Research Logistics, 51, 949-958.
4. Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals Discrete Mathematics, 5, 287-326.
5. Lee, C. Y., & Uzsoy, R. (1999). Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research, 37, 219-236.
6. Lee, C. Y., Uzsoy, R., & Martin Vega, L. A. (1992). Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research, 40, 764-775. (Pubitemid 23581869)
7. Li, S., Li, G., Wang, X., & Liu, Q. (2005). Minimizing makespan on a single batching machine with release times and non-identical job sizes. Operations Research Letters, 33, 157-164.
8. Liu, Z., & Yu, W. (2000). Scheduling one batch processor subject to job release dates. Discrete Applied Mathematics, 105, 129-136.
9. Ng, C. T., Cheng, T. C. E., & Yuan, J. J. (2002). A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints. Operations Research Letters, 30, 66-68. (Pubitemid 34623653)
10. Ng, C. T., Cheng, T. C. E., & Yuan, J. J. (2003). The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard. Journal of Scheduling, 6, 483-490.
11. Nong, Q. Q., Cheng, T. C. E., & Ng, C. T. (2008). An improved online algorithm for scheduling on two unrestrictive parallel batch processing machines. Operations Research Letters, 36, 584-588.
12. Tian, J., Fu, R., & Yuan, J. (2009). A best online algorithm for scheduling on two parallel batch machines. Theoretical Computer Science, 410, 2291-2294.
13. Uzsoy, R. (1994). A single batch processing machine with nonidentical job sizes. International Journal of Production Research, 32, 1615-1635.
14. Yuan, J. J., Liu, Z. H., Ng, C. T., & Cheng, T. C. E. (2004). The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan. Theoretical Computer Science, 320, 199-212.
15. Zhang, G., Cai, X., & Wong, C. K. (2001). On-line algorithms for minimizing makespan on batch processing machines. Naval Research Logistics, 48, 241-258. (Pubitemid 32286988)
16. Zhang, G., Cai, X., & Wong, C. K. (2003). Optimal on-line algorithms for scheduling on parallel batch processing machines. IIE Transactions, 35, 175-181.