Ten notes on equal-processing-time scheduling: At the frontiers of solvability in polynomial time

4OR

Volumn 2, Issue 2, 2004, Pages 111-127

  Baptiste, Philippe ^a   Brucker, Peter ^b   Knust, Sigrid ^b   Timkovsky, Vadim G ^c  

^a UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

^b UNIVERSITY OF OSNABRÜCK   (Germany)

^c MCMASTER UNIVERSITY   (Canada)

Author keywords

Computational complexity; Polynomial time; Scheduling

Indexed keywords

EID: 84891641042     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-003-0024-4     Document Type: Article

References (27)

1. Baptiste Ph (1999) Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine when processing times are equal. Journal of Scheduling 2: 245-252.
2. Baptiste Ph (2000a) Scheduling equal-length jobs on identical parallel machines. Discrete Applied Mathematics 103: 21-32.
3. Baptiste Ph (2000b) Preemptive scheduling of identical machines. Technical report, Université de Technologie de Compiègne, Compiègne.
4. Brucker P (1998) Scheduling algorithms. Springer, Berlin Heidelberg NewYork.
5. Brucker P, Gladky A, Hoogeveen H, Kovalyov M, Potts C, Tautenhahn T, van de Velde S (1998) Scheduling a batching machine. Journal of Scheduling 1: 31-54.
6. Brucker P, Heitmann S, Hurink J (2003) How useful are preemptive schedules? Operations Reserach Letters 31: 129-136.
7. Brucker P, Jurisch B, Jurisch M (1993) Open shop problems with unit time operations. Zeitschrift für Operations Research 37: 59-73.
8. Brucker P, Knust S (web page) Complexity results for scheduling problems. http://www. mathematik. uniosnabrueck. de/research/OR/class/.
9. Chuzhoy J, Ostrovsky R, RabaniY (2001) Approximation algorithms for the job interval selection problem and related scheduling problems. Proc. 42nd annual symposium on foundations of computer science. Las Vegas, Nevada.
10. Dantzig GB (1998) Linear programming and extensions, 11th ed. Princeton University Press, Princeton, NJ.
11. Dror M, KubiakW, Dell'Olmo P (1998) 'Strong'-'weak' chain constrained scheduling. Ricerca Operativa 27: 35-49.
12. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5: 287-326.
13. HornW (1974) Some simple scheduling problems. Naval Research Logistics Quarterly 21: 177-185.
14. Hu TC (1961) Parallel sequencing and assembly line problems. Operations Research 9: 841-848.
15. Karp RM (1972) Reducibility among combinatorial problems. In: Complexity of Computer Computations. Plenum Press, NewYork, pp 85-103.
16. KubiakW, Sriskandarajah C, ZarasK (1991)Anote on the complexity of openshop scheduling problems. INFOR 29: 284-294.
17. Labetoulle J, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1984) Preemptive scheduling of uniform machines subject to release dates. In: Progress in combinatorial optimization. Academic Press, NewYork, pp 245-261.
18. Lawler EL (1979) Preemptive scheduling of uniform parallel machines to minimize the weighted number of late jobs. Report BW 106, Centre for Mathematics and Computer Science, Amsterdam.
19. Lawler EL (1983) Recent results in the theory of machine scheduling. In: Mathematical programming: the state of the art. Springer, Berlin Heidelberg NewYork, pp 202-234.
20. Lawler EL, Martel CU (1989) Preemptive scheduling of two uniform machines to minimize the number of late jobs. Operations Research 37: 314-318.
21. Lenstra JK, Rinnooy Kan AHG (1980) Complexity results for scheduling chains on a single machine. European Journal of Operational Research 4: 270-275.
22. Lushchakova I (2001) Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints. Technical report, Belorussian State University, Minsk.
23. Middendorf M, TimkovskyVG (1999)Transversal graphs for partially ordered sets: sequencing, merging and scheduling problems. Journal of Combinatorial Optimization 3: 417-435.
24. Sahni S (1979) Preemptive scheduling with due dates. Operations Research 27: 925-934.
25. Simons B (1983) Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines. SIAM Journal on Computing 12: 294-299.
26. Tautenhahn T, Woeginger GJ (1997) Minimizing the total completion time in a unit-time open shop with release dates. Operations Research Letters 20: 207-212.
27. Timkovsky VG (2003) Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity. European Journal of Operational Research 149: 355-376.