TY - JOUR
T1 - Linear time approximation scheme for the multiprocessor open shop problem
AU - Sevastianov, S.V.
AU - Woeginger, G.J.
PY - 2001
Y1 - 2001
N2 - For the r-stage open shop problem with identical parallel machines at each stage and the minimum makespan criterion, an approximation scheme is constructed with running time O(nrm+C(m,)), where n is the number of jobs, m is the total number of machines, and C(m,) is a function independent of n.
AB - For the r-stage open shop problem with identical parallel machines at each stage and the minimum makespan criterion, an approximation scheme is constructed with running time O(nrm+C(m,)), where n is the number of jobs, m is the total number of machines, and C(m,) is a function independent of n.
U2 - 10.1016/S0166-218X(00)00375-9
DO - 10.1016/S0166-218X(00)00375-9
M3 - Article
SN - 0166-218X
VL - 114
SP - 273
EP - 288
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
IS - 1-3
ER -