Heuristics for two-machine flowshop scheduling with setup times and an availability constraint

This paper studies the two-machine flowshop scheduling problem with anticipatory setup times and an availability constraint imposed on only one of the machines where interrupted jobs can resume their operations. We present two heuristics and show that their worst-case error bounds are no larger than 2/3. (c) 2005 Elsevier Ltd. All rights reserved.