The single-machine parallel-batching on-line scheduling problem with family jobs to minimize makespan

International Journal of Production Economics

Volumn 111, Issue 2, 2008, Pages 435-440

  Nong, Qingqin ^a,b   Yuan, Jinjiang ^b   Fu, Ruyan ^b   Lin, Lin ^b   Tian, Ji ^b  

^a OCEAN UNIVERSITY OF CHINA   (China)

^b ZHENGZHOU UNIVERSITY   (China)

Author keywords

Approximation algorithm; Batching; Family; On line; Single machine scheduling; Worst case analysis

Indexed keywords

APPROXIMATION ALGORITHMS; PROBLEM SOLVING;

MAXIMUM COMPLETION TIME; SINGLE-MACHINE SCHEDULING; WORST-CASE ANALYSIS;

SCHEDULING;

EID: 37349000590     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2006.12.061     Document Type: Article

References (12)

1. Azizoglu M., and Webster S. Scheduling a batch processing machine with incompatible job families. Computers & Industrial Engineering 39 (2001) 325-335
2. Brucker P. Scheduling Algorithms (2001), Springer, Berlin
3. Chen B., Deng X.T., and Zang W.A. On-line scheduling a batch processing system to minimize total weighted job completion time. Journal of Combinatorial Optimization 8 (2004) 85-95
4. Deng, X.T., Poon, C.K., Zhang, Y.Z., 1999. Approximation algorithms in batch processing. In: The eighth Annual International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, vol. 1741, Chennai, India, December 1999. Spring, Berlin, pp. 153-162.
5. Deng X.T., Poon C.K., and Zhang Y.Z. Approximation algorithms in batch processing. Journal of Combinatorial Optimization 7 (2003) 247-257
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. Poon C.K., and Yu W.C. On-line scheduling algorithms for a batch machine with finite capacity. Journal of Combinatorial Optimization 9 (2005) 167-186
8. Potts C.N., and Kovalyov M.Y. Scheduling with batching: a review. European Journal of Operational Research 120 (2000) 228-249
9. Uzsoy R. Scheduling batch processing machines with incompatible job families. International Journal of Production Research 33 (1995) 2685-2708
10. Yuan J.J., Liu Z.H., Ng C.T., and Cheng T.C.E. The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan. Theoretical Computer Science 320 (2004) 199-212
11. Zhang G.C., Cai X.Q., and Wong C.K. On-line algorithms for minimizing makespan on batch processing machines. Naval Research Logistics 48 (2001) 241-258
12. Zhang G.C., Cai X.Q., and Wong C.K. Optimal on-line algorithms for scheduling on parallel batch processing machines. IIE Transactions 35 (2003) 175-181