Complexity of machine scheduling problems

Annals of Discrete Mathematics

Volumn 1, Issue C, 1977, Pages 343-362

  Lenstra, J K ^a   Rinnooy Kan, A H G ^b   Brucker, P ^c  

^a CWI   (Netherlands)

^b ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^c UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77951139709     PISSN: 01675060     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0167-5060(08)70743-X     Document Type: Article

References (51)

1. Adolphson, D., Hu, T.C., Optimal linear ordering. SIAM J. Appl. Math. 25 (1973), 403–423.
2. J.M. Anthonisse and P. van Emde Boas, Are polynomial algorithms really good? Report BW 40, Mathematisch Centrum, Amsterdam, 1974.
3. Bratley, P., Florian, M., Robillard, P., On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem. Naval Res. Logist. Quart. 20 (1973), 57–67.
4. Bruno, J., Coffman, E.G. Jr, Sethi, R., Scheduling independent tasks to reduce mean finishing time. Comm. ACM 17 (1974), 382–387.
5. Coffman, E.G. Jr, Graham, R.L., Optimal scheduling for two-processor systems. Acta Informat. 1 (1972), 200–213.
6. Conway, R.W., Maxwell, W.L., Miller, L.W., Theory of Scheduling, 1967, Addison-Wesley, Reading MA.
7. S.A. Cook, The complexity of theorem-proving procedures, Proc. 3rd Annual ACM Symp. Theory Comput. (1971) 151–158.
8. Edmonds, J., Paths, trees, and flowers. Canad. J. Math. 17 (1965), 449–467.
9. Edmonds, J., The Chinese postman's problem. Operations Res., 13(Supplement 1), 1965, B73.
10. Fujii, M., Kasami, T., Ninomiya, K., Optimal sequencing of two equivalent processors. SIAM J. Appl. Math. 17 (1969), 784–789.
11. Erratum, 20, 1971, 141.
12. M.R. Garey, Private communication, 1975.
13. Garey, M.R., Johnson, D.S., Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput. 4 (1975), 397–411.
14. Garey, M.R., Johnson, D.S., Scheduling tasks with nonuniform deadlines on two processors. J. Assoc. Comput. Mach. 23 (1976), 461–467.
15. M.R. Garey D.S. Johnson, Two-processor scheduling with start-times and deadlines, to appear.
16. Garey, M.R., Johnson, D.S., Approximation algorithms for combinatorial problems: an annotated bibliography. Traub, J.F., (eds.) Algorithms and Complexity: New Directions and Recent Results, 1976, Academic Press, New York, 41–52.
17. Garey, M.R., Johnson, D.S., Sethi, R., The complexity of flowshop and jobshop scheduling. Math. Operations Res. 1 (1976), 117–129.
18. Garey, M.R., Johnson, D.S., Stockmeyer, L., Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1 (1976), 237–267.
19. Gilmore, P.C., Gomory, R.E., Sequencing a one-state variable machine: a solvable case of the traveling salesman problem. Operations Res. 12 (1964), 655–679.
20. Hardgrave, W.W., Nemhauser, G.L., A geometric model and a graphical algorithm for a sequencing problem. Operations Res. 11 (1963), 889–900.
21. Horn, W.A., Single-machine job sequencing with treelike precedence ordering and linear delay penalties. SIAM J. Appl. Math. 23 (1972), 189–202.
22. Horn, W.A., Minimizing average flow time with parallel machines. Operations Res. 21 (1973), 846–847.
23. Hu, T.C., Parallel sequencing and assembly line problems. Operations Res. 9 (1961), 841–848.
24. Jackson, J.R., An extension of Johnson's results on job lot scheduling. Naval Res. Logist. Quart. 3 (1956), 201–203.
25. Johnson, S.M., Optimal two- and three-stage production schedules with setup times included. Naval Res. Logist. Quart. 1 (1954), 61–68.
26. Karp, R.M., Reducibility among combinatorial problems. Miller, R.E., Thatcher, J.W., (eds.) Complexity of Computer Computations, 1972, Plenum Press, New York, 85–103.
27. Karp, R.M., On the computational complexity of combinatorial problems. Networks 5 (1975), 45–68.
28. R.M. Karp, The fast approximate solution of hard combinatorial problems, Proc. 6th Southeastern Conf. Combinatorics, Graph Theory, and Computing (1976) 15–31.
29. Knuth, D.E., A terminological proposal. SIGACT News 61 (1974), 12–18.
30. B.J. Lageweg E.L. Lawler, Private communication, 1975.
31. Lageweg, B.J., Lenstra, J.K., Rinnooy Kan, A.H.G., Minimizing maximum lateness on one machine : computational experience and some applications. Statistica Neerlandica 30 (1976), 25–41.
32. B.J. Lageweg J.K. Lenstra and A. H. G. Rinnooy Kan, Job-shop scheduling by implicit enumeration, Management Sci., to appear.
33. Lawler, E.L., On scheduling problems with deferral costs. Mangement Sci. 11 (1964), 280–288.
34. Lawler, E.L., Optimal sequencing of a single machine subject to precedence constraints. Management Sci. 19 (1973), 544–546.
35. Lawler, E.L., Sequencing to minimize the weighted number of tardy jobs. Rev. Francaise Automat. Informat. Recherche Opérationnelle 105:Supplement (1976), 27–33.
36. Lawler, E.L., A “pseudopolynomial” algorithm for sequencing jobs to minimize total tardiness. Ann. Discrete Math. 1 (1977), 331–342.
37. E.L. Lawler, Sequencing jobs to minimize total weighted completion time subject to precedence constraints, Ann. Discrete Math., to appear.
38. Lawler, E.L., Moore, J.M., A functional equation and its application to resource allocation and sequencing problems. Management Sci. 16 (1969), 77–84.
39. Lenstra, J.K., Sequencing by Enumerative Methods, Mathematical Centre Tract 69, 1977, Mathematisch Centrum, Amsterdam.
40. Lenstra, J.K., Rinnooy Kan, A.H.G., Some simple applications of the travelling salesman problem. Operational Res. Quart. 26 (1975), 717–733.
41. J.K. Lenstra and A.H.G. Rinnooy Kan, Complexity of scheduling under precedence constraints, Operations Res., to appear.
42. Moore, J.M., An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Sci. 15 (1968), 102–109.
43. Müller-Merbach, H., Optimale Reihenfolgen, 1970, Springer, Berlin.
44. Piehler, J., Ein Beitrag zum Reihenfolgeproblem. Unternehmensforschung 4 (1960), 138–142.
45. Reddi, S.S., Ramamoorthy, C.V., On the flow-shop sequencing problem with no wait in process. Operational Res. Quart. 23 (1972), 323–331.
46. Rinnooy Kan, A.H.G., Machine Scheduling Problems: Classification, Complexity and Computations, 1976, Nijhoff, The Hague.
47. Sidney, J.B., Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs. Operations Res. 23 (1975), 283–298.
48. Smith, W.E., Various optimizers for single-stage production. Naval Res. Logist. Quart. 3 (1956), 59–66.
49. Szwarc, W., Solution of the Akers-Friedman scheduling problem. Operations Res. 8 (1960), 782–788.
50. Ullman, J.D., NP-complete scheduling problems, J. Comput. System Sci. 10 (1975), 384–393.
51. Wismer, D.A., Solution of the flowshop-scheduling problem with no intermediate queues. Operations Res. 20 (1972), 689–697.