Abstract
One-operator two-machine open shop and flow shop problems are 𝒩𝒫-hard in the ordinary sense even if all the weights are the same. We discuss two different pseudo polynomial dynamic programming recursions for each of the open shop and flow shop case. Some of the running times are better than those of the best known algorithms in the literature. †E-mail: rvickson@engmail.uwaterloo.ca
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
