An Efficient Search Algorithm for Flexible Manufacturing Systems (FMS) Scheduling Problem with Finite Capacity

유한용량 Flexible Manufacturing Systems(FMS) 스케줄링 문제에 대한 효율적인 탐색 알고리즘 연구

  • Kim, Hwang-Ho (Department of Industrial Engineering, Ajou University) ;
  • Choi, Jin-Young (Department of Industrial Engineering, Ajou University)
  • Received : 2009.01.13
  • Accepted : 2009.01.21
  • Published : 2009.03.01

Abstract

In this paper, we propose an efficient search algorithm for finding an optimal schedule to minimize makespan, while avoiding deadlock situation in Flexible Manufacturing Systems (FMS) with finite capacity, in which each job needs to be processed in several job stages for completion. The proposed algorithm uses a modeling and control method based on Petri-net. Especially, we improve the efficiency of the search algorithm by using a priority rule and an efficient bounding function during the search procedure. The performance of the proposed algorithm is evaluated through a numerical experiment, showing that it holds considerable promise for providing an optimal solution efficiently comparing to past work.

Keywords

References

  1. Abdallah, I. B., EIMaraghy, H. and ElMekkawy, T. (1998), An efficient search algorithmfor deadlock-free scheduling in FMS using Petri nets,Proceedings of the 1998 IEEE International Conference on Robotics and Automation, Leuven,Belgium, 1793-1798
  2. Boer, E. R. andMurata, T. (1994), Generating Basis Siphons and Traps of Petri NetsUsing the Sign IncidenceMatrix, IEEE TransactiononCircuitsandSystems I : Fundamental Theory andApplication, 41(4), 266-271 https://doi.org/10.1109/81.285680
  3. Fanti, M. P. and Zhou, M. C. (2004), Deadlock control methods in automated manufacturing systems, IEEE Transaction on Systems, Man, and Cybernetics, 34(1), 5-22 https://doi.org/10.1109/TSMCA.2003.820590
  4. He, Y. L. andWang, G.N. (2006), Petri nets based deadlock-free scheduling for flexiblemanufacturing systems,Proceedings of 2006 IEEE onControl,Automation, Robotics and Vision, 1-5
  5. Lee, D. Y. and DiCesare, F. (1994), Scheduling FMS Using Petri Nets and Heuristic Search, IEEETransactiononRoboticsandAutomation, 10(2), 123-132 https://doi.org/10.1109/70.282537
  6. Murata, T. (1989), PetriNets : Properties, Analysis, andApplications,Proceedings of the IEEE, 77(4), 541-580 https://doi.org/10.1109/5.24143
  7. Pearl, J. (1981),Heuristic Search Theory : Survey of Recent Results,Proceeding of 7th International Joint Conference Artificial Intelligence, Vancouver, Canada, 554-562
  8. Ramaswamy, S. E. and Joshi, S. B. (1996),Deadlock-free Schedules forAutomatedManufacturingWorkstations, IEEE TransactionRoboticsAutomation, 12(3), 391-400 https://doi.org/10.1109/70.499821