Scheduling in Flexible Manufacturing Systems

  • Jacek Blazewicz
  • Klaus Ecker
  • Günter Schmidt
  • Jan Wȩglarz


A new 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.


Flow Shop Flexible Manufacture System Priority Rule Automate Guide Vehicle Total Tardiness 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Bak75.
    K. R. Baker, A comparative study of flow shop algorithms, Oper. Res. 23, 1975, 62–73.CrossRefGoogle Scholar
  2. Bak84.
    K. R. Baker, Sequencing rules and due date assignments in a job shop, Management Sci. 30, 1984, 1093–1104.CrossRefGoogle Scholar
  3. BB82.
    K. R. Baker, J. M. W. Bertrand, A dynamic priority rule for sequencing against due dates, J. Oper. Management 3, 1982, 37–42.CrossRefGoogle Scholar
  4. BCSW86.
    J. Bxazewicz, W. Cellary, R. Slowifiski, J. Wgglarz, Scheduling Under Resource Constraints - Deterministic Models, J. C. Baltzer, Basel, 1986.Google Scholar
  5. BEFLW91.
    J. Bxazewicz, H. Eiselt, G. Finke, G. Laporte, J. Wgglarz, Scheduling tasks and vehicles in a flexible manufacturing system, Internat. J. FMS 4, 1991, 5–16.Google Scholar
  6. BFR75.
    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.CrossRefGoogle Scholar
  7. BH91.
    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.CrossRefGoogle Scholar
  8. BK83.
    K. R. Baker, J. J. Kanet, Job shop scheduling with modified due dates, J. Oper. Management 4, 1983, 11–22.CrossRefGoogle Scholar
  9. Bra88.
    S. A. Brah, Scheduling in a flow shop with multiple processors, Unpublished Ph.D. Dissertation, University of Huston, Huston, TX, 1988, 30–33.Google Scholar
  10. BY86a.
    J. A. Buzacott, D. D. Yao, Flexible manufacturing systems: a review of analytical models, Management Sci. 32, 1986, 890–905.CrossRefGoogle Scholar
  11. BY86b.
    J. A. Buzacott, D. D. Yao, On queueing network models for flexible manufacturing systems, Queueing Systems 1, 1986, 5–27.CrossRefGoogle Scholar
  12. Con65.
    R. W. Conway, Priority dispatching and job lateness in a job shop, J. Industrial Engineering 16, 1965, 123–130.Google Scholar
  13. DLSS89.
    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
  14. Fre82.
    S. French, Sequencing and Scheduling: An Introduction to the Mathematics of JobShop, Wiley, J. New York, 1982.Google Scholar
  15. GLLRK79.
    R. L. Graham, E. L. Lawler, J. K. Lenstra, and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling theory: A survey, Ann. Discrete Math. 5, 1979, 287–326.CrossRefGoogle Scholar
  16. Gra66.
    R. L. Graham, Bounds for certain multiprocessing anomalies, Bell System Technical J. 54, 1966, 1563–1581.Google Scholar
  17. Gup70.
    J. N. D. Gupta, M-stage flowshop scheduling by branch and bound, Opsearch 7, 1970, 37–43.Google Scholar
  18. Jai86.
    R. Jaikumar, Postindustrial manufacturing, Harvard Buss. Rev. Nov./Dec., 1986, 69–76.Google Scholar
  19. KH82.
    J. J. Kanet, J. C. Hayya, Priority dispatching with operation due dates in a job shop, J. Oper. Management 2, 1982, 155–163.CrossRefGoogle Scholar
  20. KM87.
    S. Kochbar, R. J. T. Morris, Heuristic methods for flexible flow line scheduling, J. Manuf Systems 6, 1987, 299–314.CrossRefGoogle Scholar
  21. Lan87.
    M. A. Langston, Improved LPT scheduling identical processor systems, RAIRO Technique et Sci. Inform. 1, 1982, 69–75.Google Scholar
  22. MB67.
    G. B. McMahon, P. G. Burton, Flow shop scheduling with the branch and bound method, Oper. Res. 15, 1967, 473–481.CrossRefGoogle Scholar
  23. RRT89.
    N. Raman, R. V. Rachamadugu, F.B. Talbot, Real time scheduling of an automated manufacturing center, European J. Oper. Res. 40, 1989, 222–242.CrossRefGoogle Scholar
  24. RS89.
    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
  25. RT92.
    N. Raman, F. B. Talbot, Thejob shop tardiness problem: a decomposition approach, European J. Oper. Res.,1992, to appear.Google Scholar
  26. RTR89a.
    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.CrossRefGoogle Scholar
  27. RTR89a.
    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
  28. Sa173.
    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-Verlag, Berlin, 1975, 83–91.Google Scholar
  29. Sav85.
    M. W. P. Savelsbergh, Local search for routing problems with time windows, Annals of Oper. Res. 4, 1985, 285–305.CrossRefGoogle Scholar
  30. Sch84.
    G. Schmidt, Scheduling on semi-identical processors, Z. Oper. Res. Theory 28, 1984, 153–162.Google Scholar
  31. Sch88.
    G. Schmidt, Scheduling independent tasks on semiidentical processors with deadlines, J. Opl. Res. Soc. 39, 1988, 271–277.Google Scholar
  32. Sch89.
    G. Schmidt, CAM: Algorithmen and Decision Support fur die Fertigungssteuerung, Springer Verlag, Berlin, 1989.CrossRefGoogle Scholar
  33. SM85.
    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.CrossRefGoogle Scholar
  34. SS85.
    K. E. Stecke, J. J. Solberg, The optimality of unbalancing both workloads and machine group sizes in closed queueing networks for multiserver queues, Oper. Res. 33, 1985, 882–910.CrossRefGoogle Scholar
  35. SS89.
    C. Sriskandarajah, S. P. Sethi, Scheduling algorithms for flexible flowshops: worst and average case performance, European J. Oper. Res. 43, 1989, 143–160.CrossRefGoogle Scholar
  36. SW89.
    R. Slowiflski, J. Wgglarz (eds.), Advances in Project Scheduling, Elsevier, Amsterdam, 1989.Google Scholar
  37. Ta182.
    F. B. Talbot, Resource constrained project scheduling with time resource tradeoffs: the nonpreemptive case, Management Sci. 28, 1982, 1197–1210.CrossRefGoogle Scholar
  38. VM87.
    A. P. J. Vepsalainen, T. E. Morton, Priority rules for job shops with weighted tardiness costs, Management Sci. 33, 1987, 1035–1047.CrossRefGoogle Scholar
  39. Wit85.
    R. J. Wittrock, Scheduling algorithms for flexible flow lines, IBM J. Res. Develop. 29, 1985, 401–412.CrossRefGoogle Scholar
  40. Wit88.
    R. J. Wittrock, An adaptable scheduling algorithms for flexible flow lines, Oper. Res. 33, 1988, 445–453.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin · Heidelberg 1993

Authors and Affiliations

  • Jacek Blazewicz
    • 1
  • Klaus Ecker
    • 2
  • Günter Schmidt
    • 3
  • Jan Wȩglarz
    • 1
  1. 1.Instytut InformatykiPolitechnika PoznanskaPoznańPoland
  2. 2.Institut für InformatikTechnische Universität ClausthalClausthal-ZellerfeldGermany
  3. 3.Rechts- und Wirtschaftswissenschaftliche Fakultät Lehrstuhl für Betriebswirtschaftslehre insbesondere Wirtschaftsinformatik IIUniversität des SaarlandesSaarbrückenGermany

Personalised recommendations