Petri Net-Based Heuristic Scheduling for Flexible Manufacturing

  • Doo Yong Lee
  • Frank DiCesare
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 310)

Abstract

A flexible manufacturing system (FMS) can manufacture multiple types of products with relatively small lot sizes, using various resources such as robots and multi-purpose machines. While the increased flexibility of an FMS provides a greater number of choices of routings and resources, and allows greater productivity, it imposes a challenging problem of allocating the given resources to various processes for each product, and scheduling the activities effectively. This chapter presents a Petri net-based heuristic scheduling method for flexible manufacturing environments.

Keywords

Transportation Dispatch Dmax Valette 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    S. Ahmad and B. Li, “Robot control computation in microprocessor systems with multiple arithmetic processors using a modified DF/IHS scheduling algorithm,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 19, no. 5, pp. 1167–1178, Sep/Oct 1989.CrossRefGoogle Scholar
  2. [2]
    M. Aicardi, A. D. Febbraro and R. Minciardi, “Analysis of deterministic discrete event systems via minimax algebra,” Proceedings of the 1991 IEEE International Conference on Systems, Man, and Cybernetics, Charlottesville, VA, Oct 13–16, 1991, pp. 321–328.Google Scholar
  3. [3]
    R. Y. Al-Jaar and A. A. Desrochers, “Performance evaluation of automated manufacturing systems using generalized stochastic Petri nets,” IEEE Transactions on Robotics and Automation, vol. 6, no. 6, pp. 621–639, Dec 1990.CrossRefGoogle Scholar
  4. [4]
    K. R. Baker, Introduction to Sequencing and Scheduling, New York: John Wiley & Sons, 1974.Google Scholar
  5. [5]
    E. Bowman, “The schedule-sequencing problem,” Operations Research, vol. 7, no. pp. 621–624, 1959.CrossRefGoogle Scholar
  6. [6]
    P. J. Brucker, “Scheduling problems in connection with flexible production systems,” Proceedings of the 1991 IEEE International Conference on Robotics and Automation, Sacramento, CA, April 1991, pp. 1778–1783.Google Scholar
  7. [7]
    J. Carlier and P. Chretienne, “Timed Petri net schedules,” in Advances in Petri Nets, Rozenberg (ed.), Berlin: Springer-Verlag, 1988, pp. 62–84.Google Scholar
  8. [8]
    T. S. Chan and H. A. Pak, “Modelling of a controller for a flexible manufacturing cell,” in Simulation, R. D. Hurrion (ed.), Kempston, UK: IFS (Publications) Ltd, 1986, pp. 105–118.Google Scholar
  9. [9]
    C. L. P. Chen, “Time lower bound for manufacturing aggregate scheduling problems,” Proceedings of the 1991 IEEE International Conference on Robotics and Automation, Sacramento, CA, April 1991, pp. 830–835.Google Scholar
  10. [10]
    R. Conway, W. Maxwell and L. Miller, Theory of Scheduling, Reading, MA: Addison-Wesley, 1967.MATHGoogle Scholar
  11. [11]
    E. Falkenauer and S. Bouffouix, “A genetic algorithm for job shop,” Proceedings of the 1991 IEEE International Conference on Robotics and Automation, Sacramento, CA, April 1991, pp. 824–829.Google Scholar
  12. [12]
    S. French, Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop, Ellis Horwood, 1982.Google Scholar
  13. [13]
    S. B. Gershwin, R. R. Hildebrant, et al. “A control perspective on recent trends in manufacturing systems,” IEEE Control Systems Magazine, vol. 6, no. 2, pp. 3–15, April 1986.CrossRefGoogle Scholar
  14. [14]
    H. P. Hillion and J. Proth, “Performance evaluation of job-shop systems using timed event-graphs,” IEEE Transactions on Automatic Control, vol. 34, no. 1, pp. 3–9, Jan. 1989.MathSciNetMATHCrossRefGoogle Scholar
  15. [15]
    D. J. Hoitomt, J. B. Perkins and P. B. Luh, “Distributed scheduling of job shops,” Proceedings of the 1991 IEEE International Conference on Robotics and Automation, Sacramento, CA, April 1991, pp. 1067–1072.Google Scholar
  16. [16]
    D. J. Hoitomt, P. B. Luh and K. R. Pattipati, “A Lagrangian relaxation approach to job shop scheduling problems,” Proceedings of the 1990 IEEE International Conference on Robotics and Automation, Cincinnati, OH, May 1990, pp. 1944–1949.Google Scholar
  17. [17]
    D. J. Hoitomt, P. B. Luh and K. R. Pattipati, “Job shop scheduling,” Proceedings of the First International Conference on Automation Technology, Taipei, Taiwan, July 1990, pp. 565–574.Google Scholar
  18. [18]
    M. A. Holliday and M. K. Vernon, “A generalized timed Petri net model for performance analysis,” Proceedings of the IEEE International Workshop on Timed Petri Nets, Torino, Italy, July 1–3, 1985, pp. 181–190.Google Scholar
  19. [19]
    L. E. Holloway and B. H. Krogh, “Synthesis of feedback control logic for a class of controlled Petri nets,” IEEE Transactions on Automatic Control, vol. 35, no. 5, pp. 514–523, May 1990.Google Scholar
  20. [20]
    E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms, Rockville, MD: Computer Science Press, 1978.MATHGoogle Scholar
  21. [21]
    E. S. H. Hou and H. Y. Li, “Task scheduling for flexible manufacturing systems based on genetic algorithms,” Proceedings of the 1991 IEEE International Conference on Systems, Man, and Cybernetics, 1991, pp. 397–402.Google Scholar
  22. [22]
    C. Q. Jiang, M. G. Singh and K. S. Hindi, “Optimized routing in flexible manufacturing systems with blocking,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 21, no. 3, pp. 589–595, May/June 1991.Google Scholar
  23. [23]
    P. Kapasouris, D. Serfaty, et al. “Resource allocation and performance evaluation in large human-machine organizations,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 21, no. 3, pp. 521–532, May/June 1991.CrossRefGoogle Scholar
  24. [24]
    R. Larson and A. Odoni, Urban Operations Research, Englewood Cliffs: Prentice-Hall, 1981, pp. 360–361.Google Scholar
  25. [25]
    A. E. J. Lee, Integrated Tooling and Scheduling of Flexible Machines: Theory and Algorithms, Ph. D. Dissertation, Rensselaer Polytechnic Institute, Troy, NY, May 1989.Google Scholar
  26. [26]
    D. Y. Lee and F. DiCesare, “Integrated scheduling of flexible manufacturing systems employing automated guided vehicles,” IEEE Transactions on Industrial Electronics, to appear in December 1994.Google Scholar
  27. [27]
    D. Y. Lee and F. DiCesare, “Scheduling flexible manufacturing systems using Petri nets and heuristic search,” IEEE Transactions on Robotics and Automation, vol. 10, no. 2, pp. 123–132, April 1994.CrossRefGoogle Scholar
  28. [28]
    D. Y. Lee and F. DiCesare, “Scheduling flexible manufacturing systems with the consideration of setup times,” Proceedings of the 32nd IEEE Conference on Decision and Control, San Antonio, TX, Dec. 15–17, 1993, pp. 3264–3269.Google Scholar
  29. [29]
    D. Y. Lee and F. DiCesare, “Scheduling of flexible manufacturing systems employing automated guided vehicles,” Proceedings of the 9th International Conference on CAD/CAM, Robotics and Factories of the Future, Newark, NJ, August 17–20, 1993, in press.Google Scholar
  30. [30]
    D. Y. Lee and F. DiCesare, “Integrated models for scheduling flexible manufacturing systems,” Proceedings of the 1993 IEEE International Conference on Robotics and Automation, Atlanta, GA, May 2–7, 1993, pp. 827–832.Google Scholar
  31. [31]
    D. Y. Lee, Scheduling and Supervisory Control of Flexible Manufacturing Systems Using Petri Nets and Heuristic Search, Ph. D. Dissertation, Rensselaer Polytechnic Institute, Troy, NY, May 1993.Google Scholar
  32. [32]
    D. Y. Lee and F. DiCesare, “Petri nets and heuristic search for periodic scheduling,” Proceedings of the 1992 IEEE International Conference on Systems, Man, and Cybernetics, Chicago, IL, October 18-21, 1992, pp. 998–1003.Google Scholar
  33. [33]
    D. Y. Lee and F. DiCesare, “Experimental study of a heuristic function for FMS scheduling,” Proceedings of the 1992 Japan-USA Symposium on Flexible Automation, San Francisco, CA, July 13-15, 1992, pp. 1171–1177.Google Scholar
  34. [34]
    D. Y. Lee and F. DiCesare, “FMS scheduling using Petri nets and heuristic search,” Proceedings of the 1992 IEEE International Conference on Robotics and Automation, Nice, France, May 10-15, 1992, pp. 1057–1062.Google Scholar
  35. [35]
    P. S. Liu and L. C. Fu, “Planning and scheduling in a flexible manufacturing system using a dynamic routing method for automated guided vehicles,” Proceedings of the 1989 IEEE International Conference on Robotics and Automation, Scottsdale, AZ, 1989, pp. 1584–1589.Google Scholar
  36. [36]
    Z. P. Lo and B. Bavarian, “Job scheduling on parallel machines using simulated annealing,” Proceedings of the 1991 IEEE International Conference on Systems, Man, and Cybernetics, 1991, pp. 391–396.Google Scholar
  37. [37]
    P. B. Luh, D. J. Hoitomt, et al. “Schedule generation and reconfiguration for parallel machines,” IEEE Transactions on Robotics and Automation, vol. 6, no. 6, pp. 687–696, Dec. 1990.CrossRefGoogle Scholar
  38. [38]
    A. Manne, “On the job-shop scheduling problem,” Operations Research, vol. 8, no. pp. 219–223, 1960.MathSciNetCrossRefGoogle Scholar
  39. [39]
    P. Mellor, “A review of job shop scheduling,” Operational Research Quarterly, vol. 17, no. 2, pp. 161–171, June 1966.Google Scholar
  40. [40]
    N. Nilsson, Principles of Artificial Intelligence, Palo Alto, CA: Tioga, 1980.MATHGoogle Scholar
  41. [41]
    J. O’Brien, Scheduling Handbook, New York: McGraw-Hill, 1969.Google Scholar
  42. [42]
    K. Onaga, M. Silva and T. Watanabe, “On periodic schedules for deterministically timed Petri net systems,” Proceedings of the 4th International Workshop on Petri Nets and Performance Models, Melbourne, Australia, Dec. 2–5, 1991, pp. 210–215.Google Scholar
  43. [43]
    T. A. Owens and P. B. Luh, “A job completion time estimation method for work center scheduling,” Proceedings of the 1991 IEEE International Conference on Robotics and Automation, Sacramento, CA, April 1991, pp. 110–115.Google Scholar
  44. [44]
    J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving, Reading, MA: Addison-Wesley, 1984.Google Scholar
  45. [45]
    C. Ramamoorthy and G. Ho, “Performance evaluation of asynchronous concurrent systems using Petri nets,” IEEE Transactions on Software Engineering, vol. SE-6, no. 5, pp. 440–449, Sep. 1980.MathSciNetCrossRefGoogle Scholar
  46. [46]
    J. Rickel, “Issues in the design of scheduling systems,” in Expert Systems and Intelligent Manufacturing, Oliff (ed.), Elsevier, 1988, pp. 70–89.Google Scholar
  47. [47]
    F. Rodammer and J. K. White, “A recent survey of production scheduling,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 18, no. 6, pp. 841–851, Nov.Dec. 1988.MathSciNetCrossRefGoogle Scholar
  48. [48]
    R. V. Rogers and K. P. White, “Algebraic, mathematical programming, and network models of the deterministic job-shop scheduling problem,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 21, no. 3, pp. 693–697, May/June 1991.MathSciNetCrossRefGoogle Scholar
  49. [49]
    R. Sengupta and S. Lafortune, “Optimal control of a class of discrete event systems,” Proceedings of the IFAC International Symposium on Distributed Intelligence Systems, Arlington, VA, Aug 13–15, 1991, pp. 25–30.Google Scholar
  50. [50]
    L. Shen, Q. Chen, et al. “Truncation of Petri net models of scheduling problems for optimum solutions,” Proceedings of the Japan/USA Symposium on Flexible Automation, San Francisco, CA, July 13–15, 1992, pp. 1681–1688.Google Scholar
  51. [51]
    H. Shih and T. Sekiguchi, “A timed Petri net and beam search based online FMS scheduling system with routing flexibility,” Proceedings of the 1991 IEEE International Conference on Robotics and Automation, Sacramento, CA, April 1991, pp. 2548–2553.Google Scholar
  52. [52]
    J. Sifakis, “Performance evaluation of systems using nets,” in Net Theory and Applications, Brauer (ed.), Berlin: Springer-Verlag, 1980, pp. 307–319.CrossRefGoogle Scholar
  53. [53]
    M. Silva and R. Valette, “Petri nets and flexible manufacturing,” in Advances in Petri Nets, Berlin: Springer-Verlag, 1989, pp. 374–417.Google Scholar
  54. [54]
    A. S. Spachis and J. R. King, “Job-shop scheduling heuristics with local neighbourhood search,” International Journal of Production Research, vol. 17, no. 6, pp. 507–526, Nov/Dec 1979.CrossRefGoogle Scholar
  55. [55]
    A. Vasquez and P. B. Mirchandani, “Concurrent resource allocation for production scheduling,” Proceedings of the 1991 IEEE International Conference on Robotics and Automation, Sacramento, CA, April 1991, pp. 1060–1066.Google Scholar
  56. [56]
    N. Viswanadham and Y. Narahari, “Stochastic Petri net models for performance evaluation of automated manufacturing systems,” Information and Decision Technologies, vol. 14, no. pp. 125–142, 1988.Google Scholar
  57. [57]
    D. Zhang, “Planning using timed Pr/T nets,” Proceedings of the Japan/USA Symposium on Flexible Automation, San Francisco, CA, July 13-15, 1992, pp. 1179–1183.Google Scholar
  58. [58]
    Y. Zhang, “Solution to job-shop scheduling of FMS by neural networks,” Proceedings of the 1991 IFAC Workshop on Discrete Event System Theory and Applications in Manufacturing and Social Phenomena, Shenyang, China, June 25–27, 1991, pp. 261–266.Google Scholar

Copyright information

© Springer Science+Business Media New York 1995

Authors and Affiliations

  • Doo Yong Lee
    • 1
  • Frank DiCesare
    • 2
  1. 1.Precision Engineering and MechatronicsKorea Advanced Institute of Science and TechnologyTaejonKorea
  2. 2.Electrical, Computer, and Systems EngineeringRensselaer Polytechnic Institute TroyNew YorkUSA

Personalised recommendations