Single machine batch scheduling problem with family setup times and release dates to minimize makespan

Journal of Scheduling

Volumn 9, Issue 6, 2006, Pages 499-513

  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; Release dates; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; HEURISTIC PROGRAMMING; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

BATCHING; FAMILY; MAKESPAN; RELEASE DATES;

SCHEDULING;

EID: 33746444010     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-006-8776-2     Document Type: Article

References (7)

1. Brucker, P., Scheduling Algorithms, Springer-Verlag, Berlin 2001.
2. Bruno, J. and P. Downey, Complexity of task sequencing with deadlines, setup times and changeover costs, SIAM Journal on Computing, 7, 393-404 (1978).
3. Cheng, T. C. E., C. T. Ng and J. J. Yuan, The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard, Journal of Scheduling, 6, 483-490 (2003).
4. Garey, M. R. and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
5. Ghosh, J. B. and J. N. D. Gupta, Batch scheduling to minimize maximum lateness, Operations Research Letters, 21, 77-80 (1997).
6. Monma, C. L. and C. N. Potts, On the complexity of scheduling with batch setup times, Operations Research, 37, 798-804 (1988).
7. Potts, C. N., and M. Y. Kovalyov, Scheduling with batching: a review, European Journal of Operational Research, 120, 228-249 (2000).