Flow-shop Scheduling Problem with Weighted Work-In-Process

  • Yang, Jae-Hwan (Department of Business Administration, University of Incheon)
  • Published : 2005.05.13

Abstract

This paper considers a new flow-shop scheduling problem where a different WIP (work-in-process) state has different weight on the duration time. For the two machine case, the recognition version is NP-Complete in the strong sense. Several special cases are solved by different polynomial time algorithms. Finally, we develop a heuristic and provide an upper-bound on relative error which is tight in limit.

Keywords