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 a heuristic algorithm from
Wang and Cheng to minimize makespan and use simulation to determine the actual
error bound
