개선된 Randomizing 알고리즘을 이용한 Job Shop 일정계획에 관한 연구
(주)코리아스칼라
- 최초 등록일
- 2016.04.02
- 최종 저작일
- 2004.06
- 14페이지/ 어도비 PDF
- 가격 4,600원
* 본 문서는 배포용으로 복사 및 편집이 불가합니다.
서지정보
ㆍ발행기관 : 대한안전경영과학회
ㆍ수록지정보 : 대한안전경영과학회지 / 6권 / 2호
ㆍ저자명 : 이화기, 김민석, 이승우
영어 초록
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.
참고 자료
없음
"대한안전경영과학회지"의 다른 논문
더보기 (5/10)