Skip to main content
SpringerLink
Log in

Scheduling in Flexible Manufacturing Systems

  • Chapter
Scheduling Computer and Manufacturing Processes

  • 60 Accesses

Abstract

An important application area for machine scheduling theory comes from Flexible Manufacturing Systems (FMSs). This relatively new technology was introduced to improve the efficiency of a job shop while retaining its flexibility. An FMS can be defined as an integrated manufacturing system consisting of flexible machines equipped with tool magazines and linked by a material handling system, where all system components are under computer control [BY86a]. Existing FMSs mainly differ by the installed hardware concerning machine types, tool changing devices and material handling systems. Instances of machine types are dedicated machines or parallel multi-purpose ones. Tool changing devices can be designed to render automatic online tool transportation and assignment to the machines’ magazines while the system is running. In other cases tool changes are only possible if the operations of the system are stopped. Most of the existing FMSs have automatic part transportation capabilities.

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

Access this chapter

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 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  Google Scholar 

  2. K. R. Baker, Sequencing rules and due date assignments in a job shop, Management Sci. 30, 1984, 1093–1104.

    Article  Google Scholar 

  3. E. Balas, Discrete programming by the filter method, Oper. Res. 15, 1967, 915–957.

    Article  Google Scholar 

  4. K. R. Baker, J. M. W. Bertrand, A dynamic priority rule for sequencing against due dates, J. Oper. Management 3, 1982, 37–42.

    Article  Google Scholar 

  5. J. Błażewicz, R. E. Burkard, G. Finke, G. J. Woeginger, Vehicle scheduling in two-cycle flexible manufacturing system, Math. Comput. Modelling 20, 1994, 19–31.

    Google Scholar 

  6. J. Błażewicz, W. Cellary, R. Słowiński, J. Węglarz, Scheduling Under Resource Constraints — Deterministic Models, J. C. Baltzer, Basel, 1986.

    Google Scholar 

  7. J. Błażewicz, H. Eiselt, G. Finke, G. Laporte, J. Węglarz, Scheduling tasks and vehicles in a flexible manufacturing system, Internat. J. FMS 4, 1991, 5–16.

    Google Scholar 

  8. P. Bratley, M. Florian, P. Robillard, Scheduling with earliest start and due date constraints on multiple machines, Naval Res. Logist. Quart. 22, 1975, 165–173.

    Article  Google Scholar 

  9. S. A. Brah, J. L. Hunsucker, Branch and bound algorithm for the flow shop with multiple processors, European J. Oper. Res. 51, 1991, 88–99.

    Article  Google Scholar 

  10. K. R. Baker, J. J. Kanet, Job shop scheduling with modified due dates, J. Oper. Management 4 1983, 11–22.

    Article  Google Scholar 

  11. S. A. Brah, Scheduling in a flow shop with multiple processors, Ph.D. thesis, University of Houston, Houston, TX., 1988.

    Google Scholar 

  12. J. A. Buzacott, D. D. Yao, Flexible manufacturing systems: a review of analytical models, Management Sci. 32, 1986, 890–905.

    Article  Google Scholar 

  13. J. A. Buzacott, D. D. Yao, On queuing network models for flexible manufacturing systems, Queuing Systems 1, 1986, 5–27.

    Article  Google Scholar 

  14. R. W. Conway, Priority dispatching and job lateness in a job shop, J. Industrial Engineering 16, 1965, 123–130.

    Google Scholar 

  15. M. Desrochers, J. K. Lenstra, M. W. P. Savelsbergh, F. Soumis, Vehicle routing with time windows, in: B. L. Golden, A. A. Assad (eds.), Vehicle Routing: Methods and Studies, North-Holland, Amsterdam, 1988, 65–84.

    Google Scholar 

  16. S. French, Sequencing and Scheduling: An Introduction to the Mathematics of Job-Shop, J. Wiley, New York, 1982.

    Google Scholar 

  17. H. Friedrich, J. Keßler, E. Pesch, B. Schildt, Batch scheduling on parallel units in acrylic-glass production, ZOR 35, 1991, 321–345.

    Google Scholar 

  18. R. L. Graham, E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling theory: A survey, Ann. Discrete Math. 5, 1979, 287–326.

    Article  Google Scholar 

  19. R. L. Graham, Bounds for certain multiprocessing anomalies, Bell System Technical. 54, 1966, 1563–1581.

    Google Scholar 

  20. J. N. D. Gupta, M-stage flowshop scheduling by branch and bound, Opsearch 7, 1970, 37–43.

    Google Scholar 

  21. R. Jaikumar, Postindustrial manufacturing, Harvard Buss. Rev. Nov./Dec., 1986, 69–76.

    Google Scholar 

  22. J. J. Kanet, J. C. Hayya, Priority dispatching with operation due dates in a job shop, J. Oper. Management,2 1982, 155–163.

    Article  Google Scholar 

  23. V. Kats, E. Levner, The contrained cyclic robotic flowshop problem: a solvable case, Proc.WISOR-95, 1995.

    Google Scholar 

  24. S. Kochbar, R. J. T. Morris, Heuristic methods for flexible flow line scheduling, J. Manuf. Systems 6, 1987, 299–314.

    Article  Google Scholar 

  25. M. A. Langston, Improved LPT scheduling identical processor systems, RAIRO Technique et Sci. Inform. 1, 1982, 69–75.

    Google Scholar 

  26. G. B. McMahon, P. G. Burton, Flow shop scheduling with the branch and bound method, Oper. Res. 15, 1967, 473–481.

    Article  Google Scholar 

  27. G. L. Nemhauser, L. A. Wolsey, Integer and combinatorial optimization, Wiley, New York, 1988.

    Google Scholar 

  28. N. Raman, R. V. Rachamadugu, F. B. Talbot, Real time scheduling of an automated manufacturing center, European J. Oper. Res. 40, 1989, 222–242.

    Article  Google Scholar 

  29. R. Rachamadugu, K. Stecke, Classification and review of FMS scheduling procedures, Working Paper No 481C, The University of Michigan, School of Business Administration, Ann Arbor MI, 1989.

    Google Scholar 

  30. N. Raman, F. B. Talbot, The job shop tardiness problem: a decomposition approach, European J. Oper. Res., 1992, to appear.

    Google Scholar 

  31. N. Raman, F. B. Talbot, R. V. Rachamadugu, Due date based scheduling in a general flexible manufacturing system, J. Oper. Management 8, 1989, 115–132.

    Article  Google Scholar 

  32. N. Raman, F. B. Talbot, R. V. Rachamadugu, Scheduling a general flexible manufacturing system to minimize tardiness related costs, Working Paper # 89–1548, Bureau of Economic and Business Research, University of Illinois at Urbana — Champaign, Champaign, IL, 1989.

    Google Scholar 

  33. M. S. Salvador, A solution of a special class of flowshop scheduling problems, Proceedings of the Symposium on the theory of Scheduling and its Applications, Springer, Berlin, 1975, 83–91.

    Google Scholar 

  34. M. W. P. Savelsbergh, Local search for routing problems with time windows, Annals Oper. Res. 4, 1985, 285–305.

    Article  Google Scholar 

  35. G. Schmidt, Scheduling on semi-identical processors, ZOR 28, 1984, 153–162.

    Google Scholar 

  36. A. Schrijver, Theory of linear and integer programming, J. Wiley, New York, 1986.

    Google Scholar 

  37. G. Schmidt, Scheduling independent tasks on semi-identical processors with deadlines, J. Oper. Res. Soc. 39, 1988, 271–277.

    Google Scholar 

  38. G. Schmidt, CAM: Algorithmen und Decision Support für die Fertigungssteuerung, Springer, Berlin, 1989.

    Book  Google Scholar 

  39. K. E. Stecke, T. L. Morin, The optimality of balancing workloads in certain types of flexible manufacturing systems, European J. Oper. Res. 20, 1985, 68–82.

    Article  Google Scholar 

  40. K. E. Stecke, J. J. Solberg, The optimality of unbalancing both workloads and machine group sizes in closed queuing networks for multiserver queues, Oper. Res. 33, 1985, 882–910.

    Article  Google Scholar 

  41. C. Sriskandarajah, S. P. Sethi, Scheduling algorithms for flexible flowshops: worst and average case performance, European J. Oper. Res. 43, 1989, 143–160.

    Article  Google Scholar 

  42. R. Słowiński, J. Weglarz (eds.), Advances in Project Scheduling, Elsevier, Amsterdam, 1989.

    Google Scholar 

  43. F. B. Talbot, Resource constrained project scheduling with time resource tradeoffs: the nonpreemptive case, Management Sci. 28, 1982, 1197–1210.

    Article  Google Scholar 

  44. A. P. J. Vepsalainen, T. E. Morton, Priority rules for job shops with weighted tardiness costs, Management Sci. 33, 1987, 1035–1047.

    Article  Google Scholar 

  45. R. J. Wittrock, Scheduling algorithms for flexible flow lines, IBM J. Res. Develop. 29, 1985, 401–412.

    Article  Google Scholar 

  46. R. J. Wittrock, An adaptable scheduling algorithms for flexible flow lines, Oper. Res. 33, 1988, 445–453.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instytut Informatyki, Politechnika Poznanska, ul. Piotrowo 3a, 60-965, Poznań, Poland

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

  2. Institut für Informatik, Technische Universität Clausthal, Erzstraße 1, 38678, Clausthal-Zellerfeld, Germany

    Prof. Dr. Klaus H. Ecker

  3. Institut für Gesellschafts- und Wirtschaftswissenschaften, Universität Bonn, Adenauerallee 24-42, 53113, Bonn, Germany

    Prof. Dr. Erwin Pesch

  4. Betriebswirtschaftslehre, insbesondere Informations- und Technologiemanagement, Universität des Saarlandes, Postfach 151150, 66041, Saarbrücken, Germany

    Prof. Dr. Günter Schmidt (Lehrstuhl)

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

© 1996 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Błażewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Węglarz, J. (1996). Scheduling in Flexible Manufacturing Systems. In: Scheduling Computer and Manufacturing Processes. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03217-6_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-03217-6_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-03219-0

  • Online ISBN: 978-3-662-03217-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation