The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan

Theoretical Computer Science

Volumn 320, Issue 2-3, 2004, Pages 199-212

  Yuan, J J ^a,c   Liu, Z H ^b,c   Ng, C T ^c   Cheng, T C E ^c  

^a ZHENGZHOU UNIVERSITY   (China)

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

^c HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Batching; Family; Makespan; Scheduling

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; HEURISTIC METHODS; PARAMETER ESTIMATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SCHEDULING;

BATCH SCHEDULING; BATCHING; FAMILY; MAKESPAN;

COMPUTER SCIENCE;

EID: 2442684605     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.01.038     Document Type: Article

References (13)

1. Brucker P. Scheduling Algorithms. 2001;Springer, Berlin.
2. Brucker P., Gladky A., Hoogeveen H., Kovalyov M.Y., Potts C.N., Tautenhahn T., van de Velde S.L. Scheduling a batching machine. J. Scheduling. 1:1998;31-54.
3. P. Brucker, S. Knust, Complexity results for scheduling problems, http://www.mathematik.uni-osnabrueck.de/research/OR/class/ , 2003.
4. Cheng T.C.E., Liu Z.H., Yu W.C. Scheduling jobs with release dates and deadlines on a batch processing machine. IIE Trans. 33:2001;685-690.
5. Coffman E.G., Yannakakis M., Magazine M.J., Santos C. Batch sizing and sequencing on a single machine. Ann. Oper. Res. 26:1990;135-147.
6. Deng X., Poon C.K., Zhang Y.Z. Approximation algorithms in batch processing. Lect. Notes Comput. Sci. 1741:2000;153-162.
7. Deng X., Zhang Y.Z. Minimizing mean response time for batch processing systems. Lect. Notes Comput. Sci. 1627:1999;231-240.
8. Garey M.R., Johnson D.S. Computers and Intractability. A Guide to the Theory of NP-Completeness:1979;Freeman, San Francisco, CA.
9. Lee C.-Y., Uzsoy R., Martin-Vega L.A. Efficient algorithms for scheduling semiconductor burn-in operations. Oper. Res. 40:1992;764-775.
10. Lenstra J.K., Rinnooy Kan A.H.G., Brucker P. Complexity of machine scheduling problems. Ann. Discrete Math. 1:1977;343-362.
11. Liu Z.H., Yu W.C. Scheduling one batch processor subject to job release dates. Discrete Appl. Math. 105:2000;129-136.
12. Liu Z.H., Yuan J.J., Cheng T.C.E. On scheduling an unbounded batch machine. Operation Research Letters. 31:2003;42-48.
13. Potts C.N., Kovalyov M.Y. Scheduling with batching. a review European J. Oper. Res. 120:2000;228-249.