Open AccessScheduling problem with release time and nested machining set constraints
Author(s) -
Xiaohua Liu,
Shuguang Li
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1651/1/012042
Subject(s) - job shop scheduling , machining , scheduling (production processes) , mathematical optimization , minification , computer science , time complexity , set (abstract data type) , mathematics , algorithm , engineering , mechanical engineering , schedule , programming language , operating system
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.