Parallel batch scheduling of equal-length jobs with release and due dates

Journal of Scheduling

Volumn 13, Issue 5, 2010, Pages 463-477

  Condotta, Alessandro ^a   Knust, Sigrid ^b   Shakhlevich, Natalia V ^a  

^a UNIVERSITY OF LEEDS   (United Kingdom)

^b CLAUSTHAL UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Complexity; Parallel batching; Parallel machine scheduling; Single machine scheduling

Indexed keywords

COMPLEXITY; DUE DATES; FEASIBILITY PROBLEM; MAXIMUM LATENESS; PARALLEL BATCH; PARALLEL BATCHING; PARALLEL MACHINE; PARALLEL MACHINE PROBLEMS; PARALLEL MACHINE SCHEDULING; SINGLE-MACHINE SCHEDULING; TIME ALGORITHMS;

MACHINERY; OPTIMIZATION; PROBLEM SOLVING;

SCHEDULING ALGORITHMS;

EID: 78650179836     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-010-0176-y     Document Type: Article

References (13)

1. Baptiste, P. (2000). Batching identical jobs. Mathematical Methods of Operations Research, 52, 355-367.
2. Brucker, P. (2007). Scheduling algorithms. Berlin: Springer.
3. Cheng, T. C. E., Yuan, J. J., & Yang, A. F. (2005). Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times. Computers and Operations Research, 32, 849-859.
4. Garey, M. R., Johnson, D. S., Simons, B. B., & Tarjan, R. E. (1981). Scheduling unit-time tasks with arbitrary release times and deadlines. SIAM Journal on Computing, 10, 256-269.
5. Ikura, Y., & Gimple, M. (1986). Efficient scheduling algorithms for a single batch processing machine. Operations Research Letters, 5, 61-65.
6. Lageweg, B. J., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1976). Minimizing maximum lateness on one machine: computational experience and some applications. Statistica Neerlandica, 30, 25-41.
7. Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1993). Sequencing and scheduling: algorithms and complexity. In Graves, S. C., Rinnooy Kan, A. H. G., & Zipkin, P. H. (Eds.) Handbooks in operations research and management science, logistics of production and inventory (Vol. 4, pp. 445-522). Amsterdam: North-Holland.
8. Lee, C. Y., Uzsoy, R., & Martin-Vega, L. A. (1992). Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research, 40, 764-775.
9. Simons, B. B. (1978). A fast algorithm for multiprocessor scheduling of unit-length jobs. In IEEE 19th annual symposium on foundations of computer science (pp. 246-252).
10. Simons, B. B. (1983). Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines. SIAM Journal on Computing, 12, 294-299.
11. Simons, B. B., & Warmuth, M. K. (1989). A fast algorithm for multiprocessor scheduling of unit-length jobs. SIAM Journal on Computing, 18, 690-710.
12. Ullman, J. D. (1975). NP-complete scheduling problems. Journal of Computer and System Sciences, 10, 384-393.
13. Vakhania, N. (2003). A better algorithm for sequencing with release and delivery times on identical machines. Journal of Algorithms, 48, 273-293.