Scheduling equal processing time jobs

Handbook of Scheduling: Algorithms, Models, and Performance Analysis

Volumn , Issue , 2004, Pages 14-1-14-38

  Baptiste, Philippe ^a   Brucker, Peter ^b  

^a ECOLE POLYTECHNIQUE   (France)

^b UNIVERSITY OF OSNABRÜCK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85016796160     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (59)

1. E. L. Lawler. A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Annals of Operations Research, 26:125–133, 1990.
2. Ph. Baptiste. 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, 1999.
3. J. Carlier. Problèmes d’Ordonnancement à Contraintes de Ressources:Algorithmes et Complexité. Thèse de Doctorat d’Etat, Université Paris VI, 1984.
4. Ph. Baptiste, M. Chrobak, Ch. Dürr, W. Jawor, and N. Vakhania, Preemptive scheduling of equallength jobs to maximize weighted throughput. Submitted to Operations Research Letters.
5. B. Simons. A fast algorithm for single processor scheduling. FOCS, 1978.
6. R. McNaughton. Scheduling with deadlines and loss functions. Management Science, 6:1–12, 1959.
7. J. Du, J. Y.-T. Leung, and G. H. Young, Scheduling chain-structured tasks to minimize makespan and mean flow time. Information and Computation, 92: 219–236, 1991.
8. B. Chen, C. N. Potts, and G. J. Woeginger. A review of machine scheduling: complexity, algorithms and approximability. In D.-Z. Du and P. M. Pardalos (eds.), Handbook of Combinatorial Optimization, Kluwer, 1998
9. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, Sequencing and scheduling: algorithms and complexity. Handbook on Operations Research; and S. C. Graves, A. H. G. Rinnooy Kan, and P. Zipkin (eds.), Management Science, Elsevier, 1993.
10. Ph. Baptiste and V. Timkovsky, On preemption redundancy in scheduling unit processing time jobs on two parallel machines. Operations Research Letters, 28:205–212, 2001.
11. P. Brucker, J. Hurink, and S. Knust. A polynomial algorithm for P | p j = 1, r j, outtree |_C j. Technical Report, University of Osnabrueck, Germany, 2001.
12. Ph. Baptiste, J. Carlier, A. Kononov, M. Queyranne, S. Sevastianov, and M. Sviridenko, Structural properties of preemptive schedules. IBM Research Report.
13. P. Brucker, S. Heitmann, and J. Hurink, How useful are preemptive schedules? Operations Research Letters, 31:129–136, 2003.
14. Ph. Baptiste. Preemptive scheduling of identical machines. Research Report 314, University of Technology of Compiègne, 2000.
15. W. Horn. Some simple scheduling problems. Naval Research Logistics Quarterly, 21:177–185, 1974.
16. G. B. Dantzig. Linear Programming and Extensions, 11th printing, PrincetonUniversity Press, Princeton, NJ, 1998.
17. S. Sahni. Preemptive scheduling with due dates. Operations Research, 27:925–934, 1979.
18. M. Dror, W. Kubiak, and P. Dell’Olmo. ‘Strong’-‘Weak’ Chain Constrained Scheduling. Ricerca Operativa 27, 1998.
19. C. L. Monma. Linear-time algorithms for scheduling on parallel processors, Operations Research, 30: 116–124, 1982.
20. T. C. Hu. Parallel sequencing and assembly line problems. Operations Research, 9:841–848, 1961.
21. M. R. Garey and D. S. Johnson, Two-processor scheduling with start-times and deadlines. SIAM Journal on Computing, 6: 416–426, 1977.
22. B. Simons. Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines. SIAM Journal of Computing, 12:294–299, 1983.
23. E. L. Lawler. Optimal sequencing of a single machine subject to precedence constraints, Management Science, 19:544–546, 1973.
24. K. R. Baker, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Preemptive scheduling of a single machine to minimize maximumcost subject to release states and precedence constraints, Operations Research, 26: 111–120, 1983.
25. Ph. Baptiste, P. Brucker, S. Knust, and V. G. Timkovsky, Fourteen notes on equal-processing-time scheduling. Submitted.
26. K. R. Baker. Introduction to Sequencing and Scheduling. JohnWiley & Sons, New York, 1974.
27. Ph. Baptiste. Scheduling equal-length jobs on identical parallel machines. Discrete Applied Mathematics, 103:21–32, 2000.
28. E. L. Lawler. Sequencing jobs to minimize total weighted completion time subject to precedence constraints, Annals of Discrete Mathematics, 2:75–90, 1978.
29. J. K. Lenstra and A. H. G. RinnooyKan. Complexity results for scheduling chains on a singlemachine. European Journal of Operation Research 4, 270–275, 1980.
30. J. K. Lenstra and A. H. G. Rinnooy Kan. Complexity of scheduling under precedence constraints, Operations Research, 26: 22–35, 1978.
31. J. Y.-T. Leung and G. H. Young, Minimizing total tardiness on a single machine with precedence constraints. ORSA Journal on Computing, 2: 346–352, 1990.
32. P. Brucker, M. R. Garey, and D. S. Johnson, Scheduling equal-length tasks under tree-like precedence constraints to minimize maximum lateness. Mathematics of Operations Research, 2: 275–284, 1977.
33. G. I. Davida and D. J. Linton. Anew algorithm for the scheduling of tree structured tasks, Proceedings of Conference on Information, Science and System. Baltimore, MD, 543–548, 1976.
34. M. I. Dessouky, B. J. Lageweg, J. K. Lenstra, and S. L. van de Velde. Scheduling identical jobs on uniform parallel machines. Statistica Neerlandica 44: 115–123, 1990.
35. P. Brucker, J. Hurink, and W. Kubiak, Scheduling identical jobs with chain precedence constraints on two uniform machines: Mathematical Methods of Operations Research, 49: 211–219.
36. M. R. Garey and D. S. Johnson, Scheduling tasks with nonuniform deadlines on two processors. Journal of the Association for Computing Machinery, 23: 461–467, 1976.
37. E. G. Coffman Jr. and R. L. Graham. Optimal scheduling fortwo-processor systems, Acta Informatica, 1: 200–213, 1972.
38. W. Horn. Minimizing average flow time with parallel machines. Operations Research, 21: 846–847, 1973.
39. J. L. Bruno, E. G. Coffman, and R. Sethi, Scheduling independent tasks to reduce mean finishing time, Communications of the ACM, 17: 382–387, 1974.
40. J. D. Ullman. NP-complete scheduling problems, Journal of Computing SystemScience 10: 384–393, 1975.
41. W. Kubiak. Exact and approximate algorithms for scheduling unit time tasks with tree-like precedence constraints, Abstracts EURO IX - TIMS XXVIII Paris, 1988.
42. J. K. Lenstra. Unpublished.
43. V. G. Timkovsky. Identical parallel machines vs. unit-time shops, preemptions vs. chains, and other offsets in scheduling complexity, Technical Report, Department of Computer Science and Systems, McMaster University, Hamilton, 1998.
44. E. L. Lawler. Preemptive scheduling of precedence-constrained jobs on parallel machines, in Dempster et al.: Deterministic and Stochastic Scheduling, Reidel, Dordrecht, 1982.
45. R. R. Muntz and E. G. Coffman Jr. Optimal preemptive scheduling on two-processor systems, IEEE Transactions on Computers C-18, 1014–1020, 1969.
46. T. Gonzalez, D. S. Johnson. A new algorithm for preemptive scheduling of trees. Journal of the Association for Computing Machinery, 27: 287–312, 1980.
47. E. C. Horvath, S. Lam, and R. Sethi. A level algorithm for preemptive scheduling. Journal of the Association for Computing Machinery, 24: 32–43, 1977.
48. M. R. Garey and D. S. Johnson, Computers and Intractability. A Guide to the Theory of NP Completeness. W. H. Freeman & Co., 1979.
49. E. L. Lawler and J. Labetoulle, On preemptive scheduling of unrelated parallel processors by linear programming. Journal of ACM, 25:612–619, 1978.
50. E. G. Coffman, J. Sethuraman, and V. G. Timkovsky, Ideal preemptive schedules on two processors, Technical Report, Columbia University, 2002.
51. L. A. Herrbach and J. Y.-T. Leung. Preemptive scheduling of equal length jobs on two machines to minimize mean flow time. Operations Research, 38:487–494, 1990.
52. J. Labetoulle, E. L. Lawler, J. K. Lenstra, and A. H. G. RinnooyKan. Preemptive scheduling of uniform machines subject to release dates. Progress in Combinatorial Optimization, 245–261, 1984.
53. J. Y.-T. Leung and G. H. Young, Preemptive scheduling to minimize mean weighted flow time. Information Processing Letters, 34: 47–50, 1990.
54. P. Brucker and S. A. Kravchenko, Preemption can make parallel machine scheduling problems hard. Osnabruecker Schriften zur Mathematik, Reihe P, Nr. 211.
55. P. Brucker. Scheduling Algorithms. Springer Lehrbuch, 2001.
56. J. Carlier. Problème à une machine et algorithmes polynˆomiaux. QUESTIO, 5(4):219–228, 1981.
57. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. RinnooyKan. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5:287–326, 1979.
58. M. R. Garey, D. S. Johnson, B. B. Simons, and R. E. Tarjan, Scheduling unit-time tasks with arbitrary release times and deadlines. SIAM Journal of Computing, 10:256–269, 1981.
59. J. K. Lenstra, A. H. G. Rinnooy Kan, and P. Brucker, Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1:343–362, 1977.