Abstract
In this chapter we will consider scheduling tasks on dedicated processors (machines). As we said in Section 3.1 we assume that tasks form n subsets (or jobs), belonging to set J, and two adjacent tasks of a job are to be performed on different machines. Unfortunately, most scheduling problems of this kind are NP-hard, which is especially true for optimality criteria other than C max. In the first two sections we will concentrate first on polynomial time algorithms, where special cases of flow shop and open shop scheduling problems will be considered. Then the job shop scheduling problem will be discussed and two approaches, a heuristic based on simulated annealing and an exact based on branch and bound will be presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. O. Achugbue, F. Y. Chin, Scheduling the open shop to minimize mean flow time, SIAM J. Comput. 11, 1982, 709–720.
J. Adams, E. Balas, D. Zawack, The shifting bottleneck procedure for job shop scheduling, Management Sci. 34, 1988, 391–401.
S. H. Akers, A graphical approach to production scheduling problems, Oper. Res. 4, 1956, 244–245.
E. H. L. Aarts, P. J. M. van Laarhoven, Statistical cooling: a general approach to combinatorial optimization problems, Philips J. of Research 40, 1985, 193–226.
I. Barany, A vector-sum theorem and its application to improving flow shop guarantees, Math. Oper. Res. 6, 1981, 445–452.
P. Brucker, B. Jurisch, B. Sievers, A branch & bound algorithm for the job-shop scheduling problem, Osnabriicker Schriften zur Mathematik, Universitat Osnabriick, 1992.
P. Brucker, Minimizing maximum lateness in a two-machine unit-time job shop, Computing 27, 1981, 367–370.
P. Brucker, An efficient algorithm for the job-shop problem with two jobs, Computing 40, 1988, 353–359.
J. Carlier, The one machine sequencing problem, European J. Oper. Res. 11, 1982, 42–47.
J. Carlier, E. Pinson, A polynomial time algorithm for determining efficient immediate selections for the job-shop problem, Technical Report, Angers/Compiegne, 1989.
J. Carlier, E. Pinson, An algorithm for solving the job-shop problem, Management Sci. 35, 1989, 164–176.
Y. Cho, S. Sahni, Preemptive scheduling of independent jobs with release and due times on open, flow and job shops, Oper. Res. 29, 1981, 511–522.
H. Fisher, G. L. Thompson, Probabilistic learning combinations of local job-shop scheduling rules, in: J. F. Muth, G. L. Thompson (eds.), Industrial Scheduling, Englewood Cliffs, N. J., Prentice Hall, 1963, 225–251.
P. C. Gilmore, R. E. Gomory, Sequencing a one-state variable machine: a solvable case of the traveling salesman problem, Oper. Res. 12, 1964, 655–679.
M. R. Garey, D. S. Johnson, R. Sethi, The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1, 1976, 117–129.
J. Grabowski, E. Nowicki, S. Zdrzalka, A block approach for single machine scheduling with release dates and due dates, European J. Oper. Res. 26, 1986, 278–285.
T. Gonzalez, S. Sahni, Open shop scheduling to minimize finish time, J. Assoc. Comput. Mach. 23, 1976, 665–679.
T. Gonzalez, S. Sahni, Flowshop and jobshop schedules: complexity and approximation. Oper. Res. 26, 1978, 36–52.
H. Hefetz, I. Adiri, An efficient optimal algorithm for the two machine unit-time job-shop schedule-length problem, Math. Oper. Res. 7, 1982, 354–360.
W. H. Hardgrave, G. L. Nemhauser, A geometric model and a graphical algorithm for a sequencing problem, Oper. Res. 11, 1963, 889–900.
J. R. Jackson, An extension of Johnson’s results on job lot scheduling, Naval Res. Logist. Quart. 3, 1956, 201–203.
S. M. Johnson, Optimal two-and-three-stage production schedules, Naval Res. Logist. Quart. 1, 1954, 61–68.
B. J. Lageweg, unpublished.
P. J. M. van Laarhoven, E. H. L. Aarts, J. K. Lenstra, Job shop scheduling by simulated annealing, Oper. Res. 40, 1992, 113–125.
J. K. Lenstra, unpublished result.
E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, Minimizing maximum lateness in two machine open shop, Math. Oper. Res. 6, 1981, 153–158.
E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, Recent developments in deterministic sequencing and scheduling: a survey, in: M. A. H. Dempster, J. K. Lenstra, A. H. G. Rinnooy Kan (eds.) Deterministic and Stochastic Scheduling, Reidel, Dordrecht, 1982, 35–73.
H. Matsuo, C. J. Suh, R. S. Sullivan, A controlled search simulated annealing method for the general job shop scheduling problem, WP #03-04-88, Department of Management, Graduate School of Business, University of Texas, Austin 1988.
C. N. Potts, Analysis of heuristics for two-machine flow- shop sequencing subject to release dates, Math. Oper. Res. 10, 1985, 576–584
H. Röck, The three machine no-wait flow shop problem is NP- complete, J. Assoc. Comput. Mach. 31, 1984, 336–345.
S. S. Reddi, C. V. Ramamoorthy, On the flow-shop sequencing problem with no wait in process, Oper. Res. Quart. 23, 1972, 323–331.
B. Roy, B. Sussmann, Les problémes d’ordonnancement avec contraintes disjonctives, Note DS #9 bis, SEMA, Paris, 1964.
H. Röck, G. Schmidt, Machine aggregation heuristics in shop scheduling, Methods of Oper. Res. 45, 1983, 303–314.
S. V. Sevastjanov, On some geometric methods in scheduling theory: A survey, Discrete Appl. Math. 1992, to appear.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin · Heidelberg
About this chapter
Cite this chapter
Błazewicz, J., Ecker, K.H., Schmidt, G., Węglarz, J. (1994). Static Shop Scheduling. In: Scheduling in Computer and Manufacturing Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-79034-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-79034-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-79036-2
Online ISBN: 978-3-642-79034-8
eBook Packages: Springer Book Archive