Skip to main content
SpringerLink
Log in
Book cover

Scheduling Computer and Manufacturing Processes pp 247–272Cite as

Scheduling in Flow and Open Shops

  • Chapter

  • 438 Accesses

Abstract

Consider scheduling tasks on dedicated processors or machines. We assume that tasks belong to a set of n jobs, each of which is characterized by the same machine sequence. For convenience, let us assume that any two consecutive tasks of the same job are to be processed on different machines. The type of factory layout in the general case — handled in Chapter 8 — is the job shop; the particular case where each job is processed on a set of machines in the same order is the flow shop. A part of this chapter will also consider the situation where no predefined machine or processor sequences are existing. This results in the case of scheduling a set of jobs on a set of machines in any order — the open shop. The most commonly used performance measure will be makespan minimization.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. O. Achugbue, F. Y. Chin, Scheduling the open shop to minimize mean flow time, SIAM J. Comput. 11, 1982, 709–720.

    Article  Google Scholar 

  2. S. B. Akers, A graphical approach to production scheduling problems, Oper. Res. 4, 1956, 244–245.

    Article  Google Scholar 

  3. K. R. Baker, Introduction to Sequencing and Scheduling, J. Wiley, New York, 1974.

    Google Scholar 

  4. K. R. Baker, A comparative study of flow shop algorithms, Oper. Res. 23, 1975, 62–73.

    Article  Google Scholar 

  5. I. Barany, A vector-sum theorem and its application to improving flow shop guarantees, Math. Oper. Res. 6, 1981, 445–452.

    Article  Google Scholar 

  6. P. Brucker, An efficient algorithm for the job-shop problem with two jobs, Computing 40, 1988, 353–359.

    Article  Google Scholar 

  7. J. Carlier, The one machine sequencing problem, European J. Oper. Res. 11, 1982, 42–47.

    Article  Google Scholar 

  8. H. G. Campbell, R. A. Dudek, M. L. Smith, A heuristic algorithm for the n job, m machine sequencing problem, Management Sci. 16B, 1970, 630–637.

    Article  Google Scholar 

  9. R. W. Conway, W. L. Maxwell, L. W. Miller, Theory of Scheduling, Addison Wesley, Reading, Mass., 1967.

    Google Scholar 

  10. 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.

    Article  Google Scholar 

  11. D. G. Dannenbring, An evaluation of flow shop sequencing heuristics, Management Sci. 23, 1977, 1174–1182.

    Article  Google Scholar 

  12. U. Domdorf, E. Pesch, T. Phan Huy, Solving the open shop scheduling problem, Journal of Scheduling,2000, to appear.

    Google Scholar 

  13. R. A. Dudek, S. S. Panwalkar, M. L. Smith, The lessons of flowshop scheduling research, Oper. Res. 40, 1992, 7–13.

    Article  Google Scholar 

  14. 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.

    Article  Google Scholar 

  15. M. R. Garey, D. S. Johnson, R. Sethi, The complexity of flowshop and jobshop scheduling, Math. Oper. Res. 1, 1976, 117–129.

    Article  Google Scholar 

  16. T. Gonzalez, S. Sahni, Open shop scheduling to minimize finish time, J. Assoc. Comput. Mach. 23, 1976, 665–679.

    Article  Google Scholar 

  17. T. Gonzalez, S. Sahni, Flowshop and jobshop schedules: Complexity and approximation, Oper. Res. 26, 1978, 36–52.

    Article  Google Scholar 

  18. J. N. D. Gupta, A functional heuristic algorithm for the flow-shop scheduling problem, Oper. Res. Quart. 22, 1971, 39–47.

    Article  Google Scholar 

  19. J. C. Ho, Y.-L- Chang, A new heuristic for the n-job, M-machine flow-shop problem, European J. Oper. Res. 52, 1991, 194–202.

    Article  Google Scholar 

  20. T. S. Hundal, J. Rajgopal, An extension of Palmer’s heuristic for the flow-shop scheduling problem, Internat. J. Prod. Res. 26, 1988, 1119–1124.

    Article  Google Scholar 

  21. E. Ignall, L. E. Schrage, Application of the branch-and-bound technique to some flow-shop scheduling problems, Oper. Res. 13, 1965, 400–412.

    Article  Google Scholar 

  22. S. M Johnson, Optimal two-and three-stage production schedules with setup times included, Naval Res. Logist. Quart. 1, 1954, 61–68.

    Article  Google Scholar 

  23. S. M. Johnson, Discussion: Sequencing n jobs on two machines with arbitrary time lags, Management Sci. 5, 1958, 299–303.

    Article  Google Scholar 

  24. T. Kawaguchi, S. Kyan, Deterministic scheduling in computer systems: A survey, J. Oper. Res. Soc. Japan 31, 1988, 190–217.

    Google Scholar 

  25. W. Kubiak, C. Srishkandarajah, K. Zaras, A note on the complexity of open shop scheduling problems, INFOR 29, 1991, 284–294.

    Google Scholar 

  26. B. J. Lageweg, J. K. Lenstra, A. H. G. Rinnooy Kan, A general bounding scheme for the permutation flow-shop problem, Oper. Res. 26, 1978, 53–67.

    Article  Google Scholar 

  27. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, Minimizing maximum lateness in a two-machine open shop, Math. Oper. Res. 6, 1981, 153–158;

    Article  Google Scholar 

  28. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, Minimizing maximum lateness in a two-machine open shop, Math. Oper. Res. 7, 1982, 635.

    Article  Google Scholar 

  29. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, Sequencing and scheduling: algorithms and complexity, in: S. C. Graves, A. H. G. Rinnooy Kan, P. H. Zipkin, (eds.), Handbooks in Operations Research and Management Science, Vol. 4: Logistics of Production and Inventory, Elsevier, Amsterdam, 1993.

    Google Scholar 

  30. Z. A. Lomnicki, A branch-and-bound algorithm for the exact solution of the three-machine scheduling problem, Oper. Res. Quart. 16, 1965, 89–100.

    Article  Google Scholar 

  31. J. K. Lenstra, R. H. G. Rinnooy Kan, P. Brucker, Complexity of machine scheduling problems, Ann. Discrete Math. 4, 1977, 121–140.

    Article  Google Scholar 

  32. G. B. McMahon, Optimal production schedules for flow shops, Canadian Oper. Res. Soc. J. 7, 1969, 141–151.

    Google Scholar 

  33. L. G. Mitten, Sequencing n jobs on two machines with arbitrary time lags, Management Sci. 5, 1958, 293–298.

    Article  Google Scholar 

  34. C. L. Monma, The two-machine maximum flow time problem with seriesparallel precedence relations: An algorithm and extensions, Oper. Res. 27, 1979, 792–798.

    Article  Google Scholar 

  35. C. L. Monma, Sequencing to minimize the maximum job cost, Oper. Res. 28, 1980, 942–951.

    Article  Google Scholar 

  36. C. L. Monma, A. H. G. Rinnooy Kan, A concise survey of efficiently solvable special cases of the permutation flow-shop problem, RAIRO Rech. Opér. 17, 1983, 105–119.

    Google Scholar 

  37. C. L. Monma, J. B. Sidney, Sequencing with series-parallel precedence, Math. Oper. Res. 4, 1979, 215–224.

    Article  Google Scholar 

  38. M. Nawaz, E. E. Enscore, I. Ham, A heuristic algorithm for the m-machine, njob flow-shop sequencing problem, Omega 11, 1983, 91–95.

    Article  Google Scholar 

  39. E. Nowicki, C. Smutnicki, New results in the worst-case analysis for flowshop scheduling, Discrete Appl. Math. 46, 1993, 21–41.

    Article  Google Scholar 

  40. E. Nowicki, C. Smutnicki, A fast tabu search algorithm for the permutation flow-shop problem, European J. Oper. Res. 91, 1966, 160–175

    Article  Google Scholar 

  41. I. H. Osman, C. N. Potts, Simulated annealing for permutation flow-shop scheduling, Omega 17, 1989, 551–557.

    Article  Google Scholar 

  42. F. A. Ogbu, D. K. Smith, The application of the simulated annealing algorithm to the solution of the nIm/C flowshop problem, Comput. Oper. Res. 17, 1990, 243–253.

    Article  Google Scholar 

  43. D. S. Palmer, Sequencing jobs through a multi-stage process in the minimum total time–a quick method of obtaining a near optimum, Oper. Res. Quart. 16, 1965, 101–107.

    Article  Google Scholar 

  44. C. N. Potts, Analysis of heuristics for two-machine flow-shop sequencingsubject to release dates, Math. Oper. Res. 10, 1985, 576–584.

    Article  Google Scholar 

  45. C. N. Potts, D. B. Shmoys, D. P. Williamson, Permutation vs. non-permutation flow shop schedules, Oper. Res. Lett. 10, 1991, 281–284.

    Article  Google Scholar 

  46. C. Reeves, A genetic algorithm for flowshop sequencing, Comput. Oper. Res. 22, 1995, 5–13.

    Article  Google Scholar 

  47. H. Röck, The three-machine no-wait flow shop problem is NP-complete, J. Assoc. Comput. Mach. 31, 1984, 336–345.

    Article  Google Scholar 

  48. S. S. Reddi, C. V. Ramamoorthy, On the flow shop sequencing problem with no wait in process, Oper. Res. Quart. 23, 1972, 323–331.

    Article  Google Scholar 

  49. H. Röck, G. Schmidt, Machine aggregation heuristics in shop scheduling, Methods Oper. Res. 45, 1983, 303–314.

    Google Scholar 

  50. S. Stöppler, C. Bierwirth, The application of a parallel genetic algorithm to the n/m/P/ Cmax flowshop problem, in: T. Gulledge, A. Jones, (eds.), New Directions for Operations Research in Manufacturing,Springer, Berlin, 1992, 161175.

    Google Scholar 

  51. J. B. Sidney, The two-machine maximum flow time problem with seriesparallel precedence relations, Oper. Res. 27, 1979, 782–791.

    Article  Google Scholar 

  52. E. F. Stafford, On the development of a mixed-integer linear programming model for the flowshop sequencing problem, J. Oper. Res. Soc. 39, 1988, 1163–1174.

    Google Scholar 

  53. W. Szwarc, Elimination methods in the m x n sequencing problem. Naval Res. Logist. Quart. 18, 1971, 295–305.

    Article  Google Scholar 

  54. W. Szwarc, Optimal elimination methods in the m x n sequencing problem, Oper. Res. 21, 1973, 1250–1259.

    Article  Google Scholar 

  55. W. Szwarc, Dominance conditions for the three-machine flow-shop problem, Oper. Res. 26, 1978, 203–206.

    Article  Google Scholar 

  56. E. Taillard, Some efficient heuristic methods for the flow shop sequencing problem, European J. Oper. Res. 47, 1990, 65–74.

    Article  Google Scholar 

  57. V. S. Tanaev, Y. N. Sotskov, V. A. Strusevich, Scheduling Theory. Multi-Stage Systems, Kluwer, Dordrecht, 1994.

    Google Scholar 

  58. H. M. Wagner, An integer linear-programming model for machine scheduling, Naval Res. Logist. Quart. 6, 1959, 131–140.

    Article  Google Scholar 

  59. F. Werner, On the combinatorial structure of the permutation flow shop problem, ZOR 35, 1990, 273–289.

    Google Scholar 

  60. M. Widmer, A. Hertz, A new heuristic method for the flow shop sequencing problem, European J. Oper. Res. 41, 1989, 186–193.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computing Science, Technical University of Poznań, Piotrowo 3a, 60-965, Poznań, Poland

    Prof. Dr. Jacek Błażewicz & Prof. Dr. Jan Węglarz

  2. Institute of Computing Science, Technical University of Clausthal, Julius-Albert Str. 4, 38678, Clausthal-Zellerfeld, Germany

    Prof. Dr. Klaus H. Ecker & Prof. Dr. Günter Schmidt

  3. Faculty of Economics, University of Bonn, Adenauerallee 24-42, 53113, Bonn, Germany

    Prof. Dr. Erwin Pesch

Authors
  1. Prof. Dr. Jacek Błażewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Prof. Dr. Klaus H. Ecker
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Prof. Dr. Erwin Pesch
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Prof. Dr. Günter Schmidt
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Prof. Dr. Jan Węglarz
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Błażewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Węglarz, J. (2001). Scheduling in Flow and Open Shops. In: Scheduling Computer and Manufacturing Processes. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04363-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-04363-9_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-07545-2

  • Online ISBN: 978-3-662-04363-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation