Title of article
Linear time approximation scheme for the multiprocessor open shop problem Original Research Article
Author/Authors
S.V. Sevastianov، نويسنده , , G.J. Woeginger، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
16
From page
273
To page
288
Abstract
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.
Keywords
Approximation scheme , Open shop , Scheduling
Journal title
Discrete Applied Mathematics
Serial Year
2001
Journal title
Discrete Applied Mathematics
Record number
885307
Link To Document