Skip to main content
SpringerLink
Log in

An efficient one-step lookahead A* algorithm for PM-CT scheduling problems

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

Abstract

In this paper, we present an improved one-step lookahead A* algorithm for the scheduling problem for parallel-mode cluster tools, where n wafer types are simultaneously processed on a cluster tool with m chambers. Specifically, we suggest a refined cost function, priority-based node selection, N-chamber cycle detection to identify deadlock situations, and a one-step lookahead method to reduce the number of unsafe states generated. Using numerical experiments, we show that the proposed algorithm leads to a significant reduction in the number of explored states and execution time necessary to find an optimal solution.

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. Dümmler M (2004) Modeling and optimization of cluster tools in semiconductor manufacturing. PhD thesis, University of Würzburg, Germany

  2. Mönch L, Fowler JW, Dauzère-Pérès S, Mason SJ, Rose O (2010) A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations. J Sched 14:1–17

    MathSciNet  Google Scholar 

  3. Agrawal GK, Heragu SS (2006) A survey of automated material handling systems in 300-mm SemiconductorFabs. IEEE Trans Semicond Manuf 19(1):112–120

    Article  Google Scholar 

  4. Lee TE (2008) A review of scheduling theory and methods for semiconductor manufacturing cluster tools. In Proceedings of the 2008 winter simulation conference, pp. 2127–2135

  5. Unbehaun R, Rose O (2006) The use of slow down factors for the analysis and development of scheduling algorithms for parallel cluster tools. In Proceedings of the 2006 winter simulation conference, pp. 1840–1847

  6. Niedermayer H, Rose O (2004a) A simulation-based analysis of the cycle time of cluster tools in semiconductor manufacturing. In Proceedings of the annual IIE industrial engineering research conference, Houston, Texas

  7. Niedermayer H, Rose O (2004b) Approximation of the cycle time of cluster tools in semiconductor manufacturing. In Proceedings of the industrial engineering research conference

  8. Unbehaun R, Rose O (2007) Predicting cluster tool behavior with slow down factors. In Proceedings of the 2007 winter simulation conference, pp. 1755–1760

  9. LeBaron T, Domasche J (2005) Optimizing robot algorithms with simulation. In Proceedings of the 2005 winter simulation conference, pp. 2211–2217

  10. Gupta AK, Sivakumar AI (2006) Job shop scheduling techniques in semiconductor manufacturing. Int J Adv Manuf Technol 27(11–12):1163–1169

    Article  Google Scholar 

  11. Cheng H-C, Chiang T-C, Fu L-C (2011) A two-stage hybrid memetic algorithm for multiobjective job shop scheduling. Expert Syst Appl 38(9):10983–10998

    Article  Google Scholar 

  12. He YL, Wang GN (2006) Petri nets based deadlock-free scheduling for flexible manufacturing systems. In Proceedings of the control, automation, robotics and vision conference, pp. 1–5

  13. Kim HH, Choi JY (2009) Development of an improved A* algorithm for capacitated FMS with considerable scale. In Proceedings of the international conference on intelligent manufacturing logistics systems

  14. Murata T (1989) Petri nets: properties, analysis, and applications. Proc IEEE 77(4):541–580

    Article  Google Scholar 

  15. Coffman EG, Elphick MJ, Shoshani A (1971) System deadlocks. ACM Comput Surv 3(2):67–78

    Article  Google Scholar 

  16. Huang B, Sun Y, Sun YM (2008) Scheduling of flexible manufacturing systems based on Petri nets and hybrid heuristic search. Int J Prod Res 46(16):553–4565

    MATH  Google Scholar 

  17. Moser M, Engell S (1992) A survey of priority rules for FMS scheduling and their performance for the benchmark problem. In Proceedings of the 31st IEEE international conference on decision and control, pp. 392–397

  18. Pierreval H (1992) Expert system for selecting priority rules in flexible manufacturing systems. Expert Syst Appl 5(1–2):51–57

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Ajou University, Suwon, South Korea

    Hwang Ho Kim & Jin Young Choi

Authors
  1. Hwang Ho Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jin Young Choi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jin Young Choi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kim, H.H., Choi, J.Y. An efficient one-step lookahead A* algorithm for PM-CT scheduling problems. Int J Adv Manuf Technol 72, 1481–1489 (2014). https://doi.org/10.1007/s00170-014-5755-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-014-5755-1

Keywords

Search

Navigation