Abstract
Chen, Glass, Potts, and Strusevich presented a heuristic algorithm, which has a worst-case performance ratio of 5/3 for the three-machine flow shop scheduling (3FSS) problem. They provided a worst-case instance of 3FSS with seven jobs to show the tightness of this bound. In this paper, we propose an alternative method to show that the bound of 5/3 is tight. Moreover, for the special case, this bound can be reduced to 1 + ρ, for 1/4 < ρ ≤ 1, which is better than 5/3.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
