Abstract
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.
Subject
General Physics and Astronomy