Minimizing the maximum lateness

Handbook of Scheduling: Algorithms, Models, and Performance Analysis

Volumn , Issue , 2004, Pages 10-1-10-12

  Kellerer, Hans ^a  

^a UNIVERSITY OF GRAZ   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (62)

1. C. N. Potts and M. Y. Kovalyov, Scheduling with batching: a review. European Journal of Operational Research, 120:228–249, 2000.
2. B. Chen, C. Potts, and G. Woeginger. A review of machine scheduling: Complexity, algorithms and approximability. In D. Z. Du and P. Pardalos, (eds.), Handbook of Combinatorial Optimization, Kluwer, 1998, pp. 21–169.
3. J. R. Jackson. Scheduling a production line to minimize maximum tardiness. Technical Report 43, University of California, Los Angeles, 1955.
4. E. L. Lawler. Optimal sequencing of a single machine subject to precedence constraints. Management Science, 19:544–546, 1973.
5. D. Hochbaum and R. Shamir, An O(n log2 n) algorithm for the maximum weighted tardiness problem. Information Processing Letters, 31:215–219, 1989.
6. M. C. Fields and G. N. Frederickson, Afaster algorithm for themaximumweighted tardiness problem. Information Processing Letters, 36:39–44, 1990.
7. F. Sourd and W. Nuijten, Scheduling with tails and deadlines. Journal of Scheduling, 4:105–121, 2001.
8. J. K. Lenstra, A. H. G. Rinnooy Kan, and P. Brucker, Complexity of machine scheduling problems. Annals of Operations Research, 1:342–362, 1977.
9. W. A. Horn. Some simple scheduling algorithms. Naval Research Logisitcs Quarterly, 21:177–185, 1974.
10. G. N. Frederickson. Scheduling unit time tasks with integer release times and deadlines. Information Processing Letters, 16:171–173, 1983.
11. B. B. Simons. A fast algorithm for single processor scheduling. In Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978, pp. 246–252.
12. J. Carlier. Problème à une machine dans le cas où les taches ont des durées égales. Technical report, Université Paris VI, Paris, 1979.
13. 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 on Computing, 10:256–269, 1981.
14. B. J. Lageweg, J. K. Lenstra, and A. H. G. Rinnooy Kan. Minimizing maximum lateness on one machine: computational experience and some applications. Statistica Neerlandica, 30:25–41, 1976.
15. C. L. Monma. Linear time algorithms for scheduling on parallel processors. Operations Research, 30:116–124, 1982.
16. 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 dates and precedence constraints. Operations Research, 31:381–386, 1983.
17. V. Gordon and V. S. Tanaev, On minimax problems of scheduling theory for a single machine. Vetsi Akademii Navuk BSSR, 1983, pp. 3–9. [in Russian] in Russian.
18. L. Schrage. Obtaining optimal solutions to resource constrained network scheduling problems. unpublished manuscript, 1971.
19. H. Kise, T. Ibaraki, and H. Mine, Performance analysis of six approximation algorithms for the one-machine maximum lateness scheduling problem with ready times. Journal of the Operational Research Society of Japan, 22:205–224, 1979.
20. C. Potts. Analysis of a heuristic for one machine sequencing with release dates and delivery times. Operations Research, 28:1436–1441, 1980.
21. L. Hall and D. Shmoys, Jackson’s rule for single-machine scheduling: making a good heuristic better. Mathematics of Operations Research, 17:22–35, 1992.
22. E. Nowicki and C. Smutnicki, An approximation algorithm for single-machine scheduling with release times and delivery times. Discrete Applied Mathematics, 48:69–79, 1994.
23. L. Hall. Approximation algorithms for scheduling. In D. Hochbaum, (ed.), Approximation Algorithms for NP-hard Problems, PWS Publishing Co., 1997, pp. 1–45.
24. L. Hall and D. Shmoys, Near-optimal sequencing with precedence constraints. In Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference (IPCO), 1990, pp. 249–260.
25. L. Hall. A note on generalizing the maximum lateness criterion for scheduling. Discrete Applied Mathematics, 47:129–137, 1993.
26. K. R. Baker and Z.-S. Su. Sequencing with due-dates and early start times to minimize maximum tardiness. Naval Research Logistics Quarterly, 21:171–176, 1974.
27. J. Carlier. The one-machine sequencing problem. European Journal of Operational Research, 11:42–47, 1982.
28. G. B. McMahon and M. Florian. Onschedulingwith ready timesandduedates tominimizemaximum lateness. Operations Research, 23:475–482, 1975.
29. R. E. Larson, M. I. Dessouky, and R. E. Devor. A forward-backward procedure for the single machine problem to minimize the maximum lateness. IIE Transactions, 17:252–260, 1985.
30. J. Grabowski, E. Nowicki, and S. Zdrzalka. A block approach for single-machine scheduling with release dates and due dates. European Journal of Operational Research, 26:278–285, 1986.
31. S. Zdrzalka and J. Grabowski, An algorithm for single machine sequencing with release dates to minimize maximum cost. Discrete Applied Mathematics, 23:73–89, 1989.
32. G. Tinhofer and E. Farnbacher. A new lower bound for the makespan of a single machine scheduling problem. In P. Kall, (ed.), System Modelling and Optimization, Lecture Notes in Control and Information Science, Springer, 1992, pp. 209–218.
33. R. McNaughton. Scheduling with deadlines and loss functions. Management Science, 12:1–12, 1959.
34. T. Gonzalez and D. B. Johnson. A new algorithm for preemptive scheduling of trees. Journal of the Association of Computing Machinery, 27:287–312, 1980.
35. S. Sahni. Preemptive scheduling with due dates. Operations Research, 27:925–934, 1979.
36. P. Baptiste. Preemptive scheduling of identical machines. Technical Report 2000/314, Université Technologie de Compiègne, 2000.
37. J. Labetoulle, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Preemptive scheduling of uniform machines subject to release dates. In W. R. Pulleyblank, (ed.), Progress inCombinatorial Optimization, Academic Press, 1984, pp. 245–261.
38. S. Sahni and Y. Cho, Scheduling independent tasks with due times on a uniform processor system. Journal of the Association of Computing Machinery, 27:550–563, 1980.
39. C. Martel. Preemptive scheduling with release dates, deadlines, and due dates. Journal of the Association of Computing Machinery, 29:812–829, 1982.
40. A. Federgruen and H. Groenevelt, Preemptive scheduling of uniformmachines by ordinary network flow techniques. Management Science, 32:341–349, 1986.
41. E. L. Lawler and J. Labetoulle, On preemptive scheduling of unrelated parallel processors by linear programming. Journal of the Association of Computing Machinery, 25:612–619, 1978.
42. J. D. Ullman. NP-complete scheduling problems. Journal of Computing and SystemSciences, 10:384–393, 1975.
43. E. L. Lawler. Preemptive scheduling of precedence-constrained jobs on parallel machines. In M. A. H. Dempster, J. K. Lenstra, and A. H. G. Rinnooy Kan, (eds.), Deterministic and Stochastic Scheduling, Reidel, 1982, pp. 101–123.
44. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. Shmoys, Sequencing and scheduling: algorithms and complexity. In S. Graves, A. H. G. Rinnooy Kan, and P. Zipkin, (eds.), Handbooks in Operations Research and Management Science, North Holland, 1993, pp. 445–522.
45. 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.
46. B. B. Simons. Multiprocessor scheduling of unit-time jobswith arbitrary release times and deadlines. SIAM Journal on Computing, 12:294–299, 1983.
47. B. B. Simons and M. K. Warmuth. A fast algorithm for multiprocessor scheduling of unit-length jobs. SIAM Journal on Computing, 18:690–710, 1989.
48. M. M. Dessouky. Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness. Computers and Industrial Engineering, 34:793–806, 1998.
49. J. K. Lenstra and A. H. G. Rinnooy Kan. Complexity of scheduling under precedence constraints. Operations Research, 26:22–35, 1978.
50. M. R. Garey and D. S. Johnson. ComputersandIntractability: a Guide to the Theory of NP-Completeness. Freeman, 1979.
51. J. K. Lenstra, D. Shmoys, and E. Tardos, Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46:259–271, 1990.
52. E. L. Lawler and J. M. Moore. A functional equation and its application to resource allocation and sequencing problems. Management Science, 16:77–84, 1969.
53. E. Horowitz and S. Sahni, Exact and approximate algorithms for scheduling nonidentical processors. Journal of the Association of Computing Machinery, 23:317–327, 1976.
54. N. Bansal. Approximation schemes for flow time onmultiple machines. Technical report, Carnegie Mellon University, 2003.
55. G. J. Woeginger. Heuristics for parallel machine scheduling with delivery times. Acta Informatica, 31:503–512, 1994.
56. L. Hall and D. Shmoys. Approximation schemes for constrained scheduling problems. In Proceedings of the 30th Symposium on Foundations of Computer Science, 1989, pp. 134–139.
57. D. Hochbaum and D. Shmoys, Using dual approximation algorithms for scheduling problems: theoretical and practical results. Journal of the Association of Computing Machinery, 34:144–162, 1987.
58. C. Koulamas and G. J. Kyparisis, Scheduling on uniform parallel machines to minimize maximum lateness. Operations Research Letters, 26:175–179, 2000.
59. J. Carlier. Scheduling jobs with release dates and tails on identical machines to minimize the makespan. European Journal of Operational Research, 29:298–306, 1987.
60. J. Carlier and E. Pinson, Jackson’s pseudo preemptive schedule for the Pm| rj, qi | Cmax scheduling problem. Annals of Operations Research, 83:41–58, 1998.
61. M. Haouari and A. Gharbi, An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines. Operations Research Letters, 31:49–52, 2003.
62. A. Gharbi and M. Haouari, Minimizing makespan on parallel machines subject to release dates and delivery times. Journal of Scheduling, 5:329–355, 2002.