논문 상세보기

개선된 Randomizing 알고리즘을 이용한 Job Shop 일정계획에 관한 연구 KCI 등재

A Study on the Job Shop Scheduling Using Improved Randomizing Algorithm

  • 언어KOR
  • URLhttps://db.koreascholar.com/Article/Detail/245174
구독 기관 인증 시 무료 이용이 가능합니다. 4,600원
대한안전경영과학회지 (Journal of Korea Safety Management & Science)
대한안전경영과학회 (Korea Safety Management & Science)
초록

The objective of this paper is to develop the efficient heuristic method for solving the minimum makespan problem of the job shop scheduling. The proposed heuristic method is based on a constraint satisfaction problem technique and a improved randomizing search algorithm. In this paper, ILOG programming libraries are used to embody the job shop model, and a constraint satisfaction problem technique is developed for this model to generate the initial solution. Then, a improved randomizing search algorithm is employed to overcome the increased search time of constrained satisfaction problem technique on the increased problem size and to find a improved solution. Computational experiments on well known MT and LA problem instances show that this approach yields better results than the other procedures.

저자
  • 이화기
  • 김민석
  • 이승우