Job shop에서 평균처리시간 최소화를 위한 할당 규칙

  • 전태준 (전남대학교 산업공학과) ;
  • 박성호 (전남대학교 산업공학과)
  • 발행 : 1996.04.01

초록

Mathematical programming method for finding optimal solution of job shop scheduling is inadequate to real situation because fo too much computation time. In contrast, dispatching rule is helpful for reducing compuation time but is not guaranted to find optimal solution. The purpose of this paper is to develop a new dispatching rule and procedure to minimize mean flow time whose result is near the optimal solution for job shop scheduling. First step is to select machine which have shortest finishing operation time among the schedulable operations. Second step is to select operation with regard to estimated remaining operation time. The suggested rule is compared with nondelay and MWKR rule for three examples, and is confirmed to be most effective to minimize mean flow time.

키워드