An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint

This paper studies the two-machine permutation flowshop scheduling problem with anticipatory setup times and an availability constraint imposed only on the first machine. The objective is to minimize the makespan. Under the assumption that interrupted jobs can resume their operations, we present a polynomial-time approximation scheme (PTAS) for this problem.

• Type: Journal
• Year: 2007
• Where: COR
• Authors: Xiuli Wang, T. C. Edwin Cheng
• Keywords: Anticipatory Setup Times, COR 2007, COR 2008, Polynomial-time Approximation Scheme, Two-machine Permutation Flowshop