Optimization of Job-Shop Schedule Considering Deadlock Avoidance

교착 회피를 고려한 Job-Shop 일정의 최적화

  • Published : 2000.08.01


As recent production facilities are usually operated with unmanned material-handling system, the development of an efficient schedule with deadlock avoidance becomes a critical problem. Related researches on deadlock avoidance usually focus on real-time control of manufacturing system using deadlock avoidance policy. But little off-line optimization of deadlock-free schedule has been reported. This paper presents an optimization method for deadlock-free scheduling for Job-Shop system with no buffer. The deadlock-free schedule is acquired by the procedure that generates candidate lists of waiting operations, and applies a deadlock avoidance policy. To verify the proposed approach, simulation resultsare presented for minimizing makespan in three problem types. According to the simulation results the effect of each deadlock avoidance policy is dependent on the type of problem. When the proposed LOEM (Last Operation Exclusion Method) is employed, computing time for optimization as well as makespan is reduced.


  1. Kim, J. U. and Kim, Y. D., 1996, 'Simulated Annealing and Genetic Algorithms for Scheduling Products with Multi-Level Product Structure,' Computers Ops Res., Vol. 23, No. 9, pp. 857-868
  2. Jain, A. S. and Meeran, S., 1999, 'Deterministic Job-Shop Scheduling : Past, Present and Future,' European Journal of Operational Research, Vol. 113, pp. 390-434
  3. Van Laarhoven, P. J. M., Aarts, E. H. L. and Lenstra, J. K., 1992, 'Job Shop Scheduling by Simulated Annealing,' Operations Research, Vol. 40, No. 1, pp. 113-125
  4. Fanti, M. P., Maione, B., Mascolo, S. and Turchiano, B., 1991, 'Event-Based Feedback Control for Deadlock Avoidance in Flexible Production Systems,' IEEE Transactions on Robotics and Automations, Vol. 13, No. 3, pp. 347-363
  5. Lawley, M. A., 1999, 'Deadlock Avoidance for Production Systems with Flexible Routing,' IEEE Transactions on Robotics and Automations, Vol. 15, No. 3, pp. 497-509
  6. Wu, N., 1999, 'Necessary and Sufficient Conditions for Deadlock-Free Operation in Flexible Manufacturing Systems Using a Colored Petri Net Model,' IEEE Transactions on Systems, Man, and Cybernetics-Part C: Applications and Reviews, Vol. 29, No. 2, pp. 192-204
  7. Ramaswamy, S. E. and Joshi, S. B., 1996, 'Deadlock-Free Schedules for Automated Manufacturing Workstations,' IEEE Transactions on Robotics and Automations, Vol. 12, No. 3, pp. 391-400
  8. Bean, J. C., 1994, 'Genetic Algorithms and Random Keys for Sequencing and Optimization,' ORSA Journal on Computing, Vol. 6, No. 2, pp. 154-160
  9. Kirkpatrick, S., Gelatt, C. D. and Vecchi, M. P., 1983, 'Optimization by Simulated Annealing,' Science, Vol. 220, pp. 671-680
  10. Hoitomt, D. J., Luh, P. B. and Pattipati, K. R., 1993, 'A Practical Approach to Job-Shop Scheduling Problems,' IEEE Trans. on Robotics and Automation, Vol. 9, No. 1, pp. 1-13
  11. 임성진, 이두용, 1997, '페트리네트를 이용한 유연생산시스템의 다중목표 스케쥴링,' 대한기계학회논문집(A), 제21권, 제5호, pp. 769-779
  12. Gere, W. S., 1966, 'Heuristics in Job Shop Scheduling,' Management Science, Vol. 13, No. 3, pp. 167-190
  13. Banaszak, Z. and Krogh, B., 1990, 'Deadlock Avoidance in Flexible Manufacturing Systems with Concurrently Competing Process flows,' IEEE Transactions on Robotics and Automation, Vol. 6, No. 6, pp. 724-734
  14. Viswanadham, N., Narahari, Y. and Johnson, T. L., 1990, 'Deadlock Prevention and Deadlock Avoidance in Flexible Manufacturing Systems Using Petri Net Models,' IEEE Transactions on Robotics and Automations, Vol. 6, No. 6, pp. 713-723
  15. Wysk, R. A., Yang, N. S. and Joshi, S., 1991, 'Detection of Deadlocks in Flexible Manufacturing Cells,' IEEE Transactions on Robotics and Automations, Vol. 7, No. 6, pp. 853-859