Proceedings of the Korean Operations and Management Science Society Conference (한국경영과학회:학술대회논문집)
- 2006.05a
- /
- Pages.1124-1132
- /
- 2006
Heuristics for Flow Shop Scheduling with Weighted WIP Costs
- Yang Jae-Hwan (School of Business, University of Seoul) ;
- Kim Hyun-Soo (Major of Industrial Engineering, Division of Advanced Industrial Engineering, Kyonggi University)
- Published : 2006.05.01
Abstract
This paper considers a flow shop scheduling problem where a different WIP (work-in-process) state has different weight on the duration time. The objective is to minimize the sum of the weighted WIP. For the two machine flow shop case, the recognition version is unary NP-Complete. The three simple and intuitive heuristics H0, H1, and H2 are presented for the problem. For each heuristic, we find an upper bound on relative error which is tight in limit. For heuristic H2, we show that H2 dominates the other two heuristics.
Keywords