Two NP-hardness results for preemptive minsum scheduling of unrelated parallel machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2081, Issue , 2001, Pages 396-405

  Sitters, Renè ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION;

MIN-SUM; MINIMIZING THE NUMBER OF; NP-HARD; NP-HARDNESS RESULTS; TOTAL COMPLETION TIME; UNRELATED PARALLEL MACHINES;

INTEGER PROGRAMMING;

EID: 84947265087     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45535-3_31     Document Type: Conference Paper

References (13)

1. P. Brucker and S.A. Kravchenko: Preemption can make parallel machine scheduling problems hard, Osnabruecker Schriften zur Mathematik, Reihe P (Preprints), Heft 211, (1999).
2. P. Brucker, S.A. Kravchenko and Y.N. Sotskov, Preemptive job-shop scheduling problems with a fixed number of jobs, Mathematical Methods of Operations Research 49 (1999), 41-76.
3. J. Bruno, E.G. Coffman Jr, R. Sethi, Scheduling independent tasks to reduce mean finishing time, Communications of the ACM 17 (1974), 382-387.
4. J. Du and J.Y.-T. Leung, Minimizing the number of late jobs on unrelated machines, Operations Research Letters 10 (1991), 153-158.
5. J. Du, J.Y.-T. Leung, Minimizing mean flow time with release time constraints, Theoretical Computer Science 75 (1990) 347-355.
6. J. Du, J.Y.-T. Leung, G.H. Young, Scheduling chain-structured tasks to minimize makespan and mean flow time, Information and Computation 92 (1991) 219-236.
7. Gonzalez, Optimal mean finish time preemptive schedules, Technical Report 220, Computer Science Department, Pennsylvania State University (1977).
8. R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals of Discrete Mathematics 4 (1979), 287-326.
9. W.A. Horn, Minimizing average flow time with parallel machines, Operations Research 21 (1973), 846-847.
10. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations, Plenum Press, New York (1972), 85-103.
11. S.A. Kravchenko, Y.N. Sotskov, Optimal makespan schedule for three jobs on two machines, Mathematical Methods of Operations Research 43 (1996), 233-238.
12. E.L. Lawler, J. Labetoulle, On preemptive scheduling of unrelated parallel processors by linear programming, Journal ofthe Association for Computing Machinery 25 (1978), 612-619.
13. E.L. Lawler, Recent results in the theory of machine scheduling, in: A. Bachem, M. Grotchel and B. Korte (eds.), Mathematical Programming: the State of the Art-Bonn 1982, Springer, Berlin-New York (1983), 202-234.