earticle

논문검색

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

원문정보

A Study on the Job Shop Scheduling Using Improved Randomizing Algorithm

이화기, 김민석, 이승우

피인용수 : 0(자료제공 : 네이버학술정보)

초록

영어

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.

목차

Abstract
 1. 서론
 2. 이론적 배경
  2.1 제약만족 기법
  2.2 ILOG
  2.3 Randomizing 알고리즘
 3. 제안된 기법을 이용한 Job Shop 일정계획
  3.1 문제 해결 방법
  3.2 제안된 알고리즘
  3.3 개선된 Randomizing 알고리즘
  3.4 프로그램이 구현 및 구성
 4. 실험 및 분석
  4.1 실험 방법 및 결과
  4.2 제안된 알고리즘과 기존 연구와의 비교
 5. 결론
 6. 참고문헌

저자정보

  • 이화기 인하대학교 산업공학과
  • 김민석 Kim Min Suk. 인하대학교 산업공학과
  • 이승우 Lee Seung Woo. 한국기계연구원

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 기관로그인 시 무료 이용이 가능합니다.

      • 4,600원

      0개의 논문이 장바구니에 담겼습니다.