총완료시간 최소화를 위한 작업순서 종속 셋업시간과 중첩 대기시간 제약을 갖는 흐름생산라인 스케줄링 (Scheduling of Flow Shop with Sequence-dependent Setup Times and Overlapping Waiting Time Constraints to Minimize the Total Completion Time)

서지정보

· 발행기관 : 한국경영과학회
· 수록지 정보 : 한국경영과학회지 / 48권 / 4호 / 39 ~ 51페이지
· 저자명 : 이준호

초록

We address a flow shop scheduling problem characterized by sequence-dependent setup times and overlapping waiting time constraints. Overlapping waiting time constrains refer to the existence of multiple waiting time limits that overlap with one another. The objective is to minimize the total completion time. We first analyze the problem and formulate a mixed integer linear programming(MILP) model that can provide an optimal solution. Due to the high computational complexity of our problem, the MILP model is only applicable to small-sized problems. To overcome this limitation, we propose an efficient heuristic algorithm capable of delivering near-optimal solutions within a very short computation time. Extensive numerical experiments are conducted to evaluate the performance of the proposed algorithm.

영어초록

We address a flow shop scheduling problem characterized by sequence-dependent setup times and overlapping waiting time constraints. Overlapping waiting time constrains refer to the existence of multiple waiting time limits that overlap with one another. The objective is to minimize the total completion time. We first analyze the problem and formulate a mixed integer linear programming(MILP) model that can provide an optimal solution. Due to the high computational complexity of our problem, the MILP model is only applicable to small-sized problems. To overcome this limitation, we propose an efficient heuristic algorithm capable of delivering near-optimal solutions within a very short computation time. Extensive numerical experiments are conducted to evaluate the performance of the proposed algorithm.

참고자료

· 없음