Abstract
For the makespan minimization problem on parallel machines in the presence of nested machining set restrictions, which is strongly NP-hard, we present the first polynomial time approximation scheme, and give the rigorous mathematical analysis for its approximation ratio.
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
