In this paper we study the two-machine flowshop scheduling problem with an availability constraint on the first machine. We first show that the worst-case error bound 1/2 of the heuristic provided by Lee is tight. We then develop an improved heuristic with a worst-case error bound of 1/3.
ASJC Scopus subject areas
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics