Minimizing makespan on a single batching machine with release times and non-identical job sizes

Operations Research Letters

Volumn 33, Issue 2, 2005, Pages 157-164

  Li, Shuguang ^a   Li, Guojun ^b,c   Wang, Xiaoli ^b   Liu, Qiming ^d  

^a YANTAI UNIVERSITY   (China)

^b SHANDONG UNIVERSITY   (China)

^c INSTITUTE OF SOFTWARE   (China)

^d LUDONG UNIVERSITY   (China)

Author keywords

Approximation algorithms; Batch processing; Makespan; Release times; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BATCH DATA PROCESSING; HEURISTIC METHODS; INTEGRATED CIRCUITS; MATHEMATICAL MODELS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; BATCH PROCESSING; RELEASE TIMES; SINGLE BATCHING MACHINE;

SCHEDULING;

EID: 9644265591     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.04.009     Document Type: Article

References (11)

1. F. Afrati, E., C. Chekuri, D. Karger, C. Kenyan, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, 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, October, 1999, pp. 32-43.
2. P. Brucker, A. Gladky, H. Hoogeveen, M.Y. Kovalyvov, C.N. Potts, T. Tautenhahn, S.L. van de Velde. Scheduling a batching machine, J. Scheduling 1 (1998) 31-54.
3. E.G. Coffman, M.R. Garey, D.S. Johnson, Approximation algorithms for bin packing: a survey, Approximation Algorithms for NP-hard Problems, PWS, Boston, 1996, pp. 46-93.
4. X. Deng, H.D. Feng, G.J. Li, A PTAS for semiconductor burn-in scheduling, J. Combin. Optim., to appear.
5. 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, December 1999, pp. 153-162.
6. M.R. Garey, D.S. Johnson, Computers and Intractability, a Guide to the Theory of NP-complctcness, Freeman, San Francisco, 1979.
7. C.Y. Lee, R. Uzsoy, Minimizing makespan on a single batch processing machine with dynamic job arrivals, Technical Report, Department of Industrial and System Engineering, University of Florida, January 1996.
8. C.Y. Lee, R. Uzsoy, L.A. Martin Vega, Efficient algorithms for scheduling semiconductor bum-in operations, Oper. Res. 40 (1992) 764-775.
9. J.K. Lenstra, D.B. Shmoys, Computing near-optimal schedules, Scheduling Theory and its Application, Wiley, New York, 1995.
10. R. Uzsoy, A single batch processing machine with non-identical job sizes, Int. J. Prod. Res. 32 (1994) 1615-1635.
11. G. Zhang, X. Cai, C.Y. Lee, C.K. Wong, Minimizing makespan on a single batch processing machine with non-identical job sizes, Naval Res. Logist. 48 (2001) 226-240.