Abstract
This paper proposes a new heuristic search approach based on an analytic theory of the Petri net state equations for scheduling flexible manufacturing systems (FMSs) with the goal of minimizing makespan. The proposed method models an FMS using a timed Petri net and exploits approximate solutions of the net's state equation to predict the total cost (makespan) from the initial state through the current state to the goal. That is, the heuristic function considers global information provided by the state equation. This makes the method possible to obtain solutions better than those obtained using prior works (Lee and DiCesare, 1994a, 1994b) that consider only the current status or limited global information. In addition, to reduce memory requirement and thus to increase the efficiency of handling larger systems, the proposed scheduling algorithm contains a procedure to reduce the searched state space.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Carlier, J. and Pinsion, E., “An Algorithm for Solving the Job-Shop Problem,” Management Science, Vol. 35, No. 2, pp. 164-176 (1989).
Chen, S.C. and Jeng, M.D., “A Heuristic Approach Based on the State Equations of Petri Nets for FMS Scheduling,” Proceedings of the 1995 IEEE Industrial Automation and Control Conference, Taipei, Taiwan, pp. 275-281 (1995a).
Chen, S.C. and Jeng, M.D., “FMS Scheduling Using Backtracking-Free Heuristic Search Based on Petri Net State Equations,” Proceedings of the 1995 IEEE International Conference on Systems, Man, and Cybernetics, Vancouver, Canada, pp. 2153-2158 (1995b).
Chen, S.C. and Jeng, M.D., “Simulation Results of a FMS Scheduling Approach Based on AI and Petri Nets,” Proceedings of the Eighth National Symposium on Automation Technology, Chung Li, Taiwan (1995c).
Foo, Yoon-Pin Simon and Takefuji, Yoshiyasu, “Integer Linear Programming Neural Networks for Job-Shop Scheduling,” Proceedings of the IEEE International Conference on Neural Networks, San Diego, CA, Vol. 2, pp. 341-348 (1988).
Hu, T.C., Integer Programming and Network Flows, Addison-Wesley, Reading, MA (1969).
Jeng, M.D. and Chen, S.C., “Integration of Scheduling and Control Using Petri Nets for Manufacturing Automation,” Proceedings of the Third International Conference on Automation Technology, Taipei, Taiwan, pp. 223-228 (1994).
Jeng, M.D. and Lin, C.S., “Petri Nets for Formulation of Aperiodic Scheduling Problems in FMSs,” Proceedings of IEEE International Conference on Emerging Technologies and Factory Automation, Los Angeles, CA, pp. 375-380 (1997).
Karmarkar, N., “Further Developments in the New Polynomial Time Algorithm for Linear Programming,” Proceedings of the Twelfth International Symposium on Mathematical Programming, Cambridge, MA (August 1985).
Kruse, R.L., Leung, B.P., and Tondo, C.L., Data Structures and Program in C, Prentice-Hall, Englewood Cliffs, NJ (1991).
Lee, D.Y. and DiCesare, F., “Integrated Scheduling of Flexible Manufacturing System Employing Automated Guided Vehicles,” IEEE Transactions on Industrial Electronics, Vol. 41, No. 6, pp. 602-608 (1994a).
Lee, D.Y. and DiCesare, F., “Scheduling Flexible Manufacturing System Using Petri Nets and Heuristic Search,” IEEE Transactions on Robotics and Automation, Vol. 10, No. 2, pp. 123-132 (1994b).
Lo, Z.P. and Bavarian, B., “Scheduling with Neural Networks for Flexible Manufacturing Systems,” Proceedings of the IEEE International Conference on Robotics and Automation, Sacramento, CA, pp. 818-823 (1991).
Luh, P.B., Hoitomt, D.J., Max, E., and Pattipati, K.R., “Schedule Generation and Reconfiguration for Parallel Machines,” IEEE Transactions on Robotics and Automation, Vol. 6, No. 6, pp. 687-696 (1990).
Luh, P.B. and Hoitomt, D.J., “Scheduling of Manufacturing Systems Using the Lagrangian Relaxation Technique,” IEEE Transactions on Automatic Control, Vol. AC-38, No. 7 (1993).
Murata, T., “Petri Nets: Properties, Analysis and Applications,” Proceedings of the IEEE, Vol. 77, No. 4, pp. 541- 580 (1989).
Narahari, Y. and Vedula, S.R., “Real-World Extensions to a Production Scheduling Algorithm Based on Lagrangian Relaxation,” Proceedings of the IEEE International Conference on Robotics and Automation, pp. 3167-3172 (1994).
Panwalker, S.S. and Iskander, W., “A Survey of Scheduling Rules,” Operations Research, Vol. 25, No. 1, pp. 45-61 (1977).
Pearl, J., Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, Reading, MA (1984).
Peterson, J.L., Petri Net Theory and the Modeling of Systems, Prentice-Hall, Englewood Cliffs, NJ (1981).
Rajendran, C., “A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan,” Journal of the Operations Research Society, Vol. 45, No. 4, pp. 472-478 (1994).
Rogers, R.V. and White, K.P., “Algebraic, Mathematical Programming, and Network Models of the Deterministic Job-Shop Scheduling Problem,” IEEE Transactions on Systems, Man, and Cybernetics, Vol. SMC-21, No. 3, pp. 693-697 (1991).
Shih, H. and Sekiguchi, T., “A Timed Petri Net and Beam Search Based On-Line FMS Scheduling System with Routing Flexibility,” Proceedings of the IEEE International Conference on Robotics and Automation, Sacramento, CA, pp. 2548-2553 (1991).
Silva, M. and Valette, R., “Petri Nets and Flexible Manufacturing,” in Advances in Petri Nets, Springer-Verlag, Berlin, pp. 374-417 (1989).
Vancheeswaran, R. and Townsend, M.A., “Two Stage Heuristic Procedure for Scheduling Job Shops,” Journal of Manufacturing Systems, Vol. 12, No. 4 (1993).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jeng, M.D., Chen, S.C. A Heuristic Search Approach Using Approximate Solutions to Petri Net State Equations for Scheduling Flexible Manufacturing Systems. International Journal of Flexible Manufacturing Systems 10, 139–162 (1998). https://doi.org/10.1023/A:1008097430956
Issue Date:
DOI: https://doi.org/10.1023/A:1008097430956