Skip to main content
SpringerLink
Log in

Scheduling FMS with alternative routings using Petri nets and near admissible heuristic search

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

This paper proposes and evaluates a near admissible heuristic search strategy and its application to a kind of flexible manufacturing system (FMS) scheduling in a Petri net framework. Petri nets can concisely model the strict precedence constraint, multiple kinds of resources, and concurrent activities. To cope with the complexities for scheduling of FMS with alternative routings, this paper proposes an admissible heuristic function based on the execution of P-timed Petri nets and presents an improved dynamic weighting A* strategy using the proposed heuristic function. The search scheme does not need to predict the depth of solution in advance and the quality of the search result is also controllable. Some numerical experiments are carried out to demonstrate usefulness of the algorithm.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Liu GJ, Jiang CJ, Wu ZH, Chen LJ (2009) A live subclass of Petri nets and their application in modeling flexible manufacturing systems. Int J Adv Manuf Technol 41(1–2):66–74

    Article  Google Scholar 

  2. Yu H, Reyes A, Cang S, Lloyd S (2003) Combined Petri net modelling and AI based heuristic hybrid search for flexible manufacturing systems—Part I Petri net modelling and heuristic search. J Comput Ind Eng 44:527–543

    Article  Google Scholar 

  3. Li ZW, Zhou MC (2006) Two-stage method for synthesizing liveness-enforcing supervisors for flexible manufacturing systems using Petri nets. IEEE Trans Ind Inf 2(4):313–325

    Article  Google Scholar 

  4. Tuncel G, Bayhan GM (2007) Applications of Petri nets in production scheduling: a review. Int J Adv Manuf Technol 34(7–8):762–773

    Article  Google Scholar 

  5. Gusikhin Y, Kulinitch AS (1993) Animated AI-based simulation in production scheduling. IFIP Trans B 11:165–176

    Google Scholar 

  6. Lee DY, Dicesare F (1994) Scheduling FMS using Petri nets and heuristic search. IEEE Trans Robot Autom 10:123–132

    Article  Google Scholar 

  7. Yim SJ, Lee DY (1996) Multiple objective scheduling for flexible manufacturing systems using Petri nets and heuristic search. In: Proceeding of the IEEE International Conference On Systems, Man and Cybernetics: Information Intelligence and Systems, Beijing, China, pp. 2984–2989

  8. Jeng MD, Chen SC (1998) A heuristic search approach using approximate solutions to Petri Net state equations for scheduling flexible manufacturing systems. Int J Flex Manuf Syst 10:139–162

    Article  Google Scholar 

  9. Pohl I (1973) The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computational issues in heuristic problem solving. In: Proceedings of the 3rd International Joint Conference on Artificial Intelligence, Stanford, California, USA, pp. 20–23

  10. Julia S, Oliveira FF, Valette R (2008) Real time scheduling of Workflow Management Systems based on a p-time Petri net model with hybrid resources. Simul Model Pract Theory 16(4):462–482

    Article  Google Scholar 

  11. Chetouane F (2008) Electroplating line flexible control using P-time Petri nets modeling and hoist waiting times calculation. Int J Ind Eng - Theory 15(3):266–277

    Google Scholar 

  12. Xiong HH, Zhou MC, Caudill RJ (1996) A hybrid heuristic search algorithm for scheduling flexible manufacturing systems. In: Proceeding of the IEEE International Conference on Robotics and Automation, Minneapolis, Minnesota, USA, pp. 2793–2797

  13. Xiong HH, Zhou MC (1998) Scheduling of semiconductor test facility via Petri nets and hybrid heuristic search. IEEE Trans Semicond Manuf 11(3):384–393

    Article  Google Scholar 

  14. Huang B, Sun YM (2005) Improved methods for scheduling flexible manufacturing systems based on Petri nets and heuristic search. J Control Theory Appl 2:139–144

    Article  MathSciNet  Google Scholar 

  15. Huang B, Sun Y, Sun YM, Zhao CX (2010) A hybrid heuristic search algorithm for scheduling FMS based on Petri net model. Int J Adv Manuf Technol 48(9–12):925–933

    Article  Google Scholar 

  16. Pearl J (1984) Heuristics: intelligent search strategies for computer problem solving. Addison-Wesley, USA

    Google Scholar 

  17. Mejia G (2002) An intelligent agent-based architecture for flexible manufacturing systems having error recovery capability. Ph.D. thesis, University of Lehigh, USA, 2002

Download references

Author information

Authors and Affiliations

  1. School of Computer Science & Technology, Nanjing University of Science and Technology, Nanjing, People’s Republic of China

    Bo Huang & Nan Xu

  2. School of Science, Nanjing University of Science and Technology, Nanjing, People’s Republic of China

    Xing-Xi Shi

Authors
  1. Bo Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xing-Xi Shi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nan Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bo Huang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, B., Shi, XX. & Xu, N. Scheduling FMS with alternative routings using Petri nets and near admissible heuristic search. Int J Adv Manuf Technol 63, 1131–1136 (2012). https://doi.org/10.1007/s00170-012-3958-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-012-3958-x

Keywords

Search

Navigation