Abstract
Abstract Under certain conditions, optimal solutions to the three-machine flowshop problem can be found by applying efficient (i.e. polynomial) algorithms. In this paper these conditions and the corresponding algorithms are summarized, and computational results are given to indicate how often these conditions succeed in sample problems.
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
