Routing Policies for Flow Shop with Competing Operations

서지정보

· 발행기관 : 한국지식정보기술학회
· 수록지 정보 : 한국지식정보기술학회 논문지 / 13권 / 6호 / 713 ~ 725페이지
· 저자명 : 조다설, 김준우

초록

This paper aims to introduce the concept of competing operations in flow shop and investigate the characteristics of the flow shop scheduling problem with competing operations. While different operations have different processing orders in traditional flow shop scheduling problem, some operations can be processed in arbitrary order in practical shop floors. In other words, the processing orders of given operations are fixed in traditional flow shop scheduling problem, however, this paper considers flow shop scheduling problem where some operations have variable processing orders. Such operations are defined as competing operations in this paper, and flow shops with competing operations require additional decisions on routing policies. In this context, we aim to propose several routing policies that can be applied to flow shops with competing operations, and to evaluate their performances in dynamic environment by applying simulation technique. Simulation experiments are performed by using a simulation model for a simple flow shop wich 2 competing operations, which is built by applying a commercial 3D factory simulation software called FlexSim. The experiment results reveal that the performances of proposed routing policies are dependent on the processing times of competing operations. Especially, routing policies based on the total processing time of predecessors have shown promising performances. This implies that the routing policies in flow shops with competing operations should be carefully designed with consideration of model parameters.

참고자료

· 없음