Minimizing makespan with release times on identical parallel batching machines

Discrete Applied Mathematics

Volumn 148, Issue 1, 2005, Pages 127-134

  Li, Shuguang ^a   Li, Guojun ^b,c   Zhang, Shaoqiang ^d  

^a YANTAI UNIVERSITY   (China)

^b INSTITUTE OF SOFTWARE   (China)

^c SHANDONG UNIVERSITY   (China)

^d TIANJIN NORMAL UNIVERSITY   (China)

Author keywords

Identical parallel batching machines; Makespan; Polynomial time approximation scheme; Scheduling

Indexed keywords

APPROXIMATION THEORY; FUNCTIONS; HEURISTIC METHODS; INTEGRATED CIRCUITS; MICROPROCESSOR CHIPS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SCHEDULING; THEOREM PROVING;

IDENTICAL PARALLEL BATCHING MACHINES; INTEGRATED CIRCUIT (IC) CHIPS; MAKESPAN; POLYNOMIAL TIME APPROXIMATION SCHEME (PTAS);

PARALLEL PROCESSING SYSTEMS;

EID: 15344344379     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.11.004     Document Type: Article

References (9)

1. F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, and M. Sviridenko Approximation schemes for minimizing average weighted completion time with release dates Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science New York 1999 32 43
2. P. Brucker, A. Gladky, H. Hoogeveen, M.Y. Kovalyvov, C.N. Potts, T. Tautenhahn, and S.L. van de Velde Scheduling a batching machine J. Scheduling 1 1998 31 54
3. X. Deng, H.D. Feng, G.J. Li, A PTAS for semiconductor burn-in scheduling, J. Comb. Optim., to appear.
4. X. Deng, C.K. Poon, Y. Zhang, Approximation algorithms in batch processing, in: The Eighth Annual International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, vol. 1741, Springer, Chennai, India, 1999, pp. 153-162.
5. R.L. Graham Bounds for certain multiprocessor anomalies Bell System Technical Journal 45 1966 1563 1581
6. R.L. Graham, Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling a survey Ann. Discrete Math. 5 1979 287 326
7. L.A. Hall, and D.B. Shmoys Approximation schemes for constrained scheduling problems Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science 1989 134 139
8. C.Y. Lee, and R. Uzsoy Minimizing makespan on a single batch processing machine with dynamic job arrivals Internat. J. Prod. Res. 37 1999 219 236
9. C.Y. Lee, R. Uzsoy, and L.A. Martin Vega Efficient algorithms for scheduling semiconductor burn-in operations Oper. Res. 40 1992 764 775