Article ID Journal Published Year Pages File Type
475520 Computers & Operations Research 2007 11 Pages PDF
Abstract

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 23.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Preview
Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
Authors
, ,