论文信息 - Linear time approximation scheme for the multiprocessor open shop problem

Linear time approximation scheme for the multiprocessor open shop problem

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. ? 2001 Elsevier Science B.V. All rights reserved.

Gerhard J. Woeginger | Sergey V. Sevastianov

[1] Sergey V. Sevastianov,et al. Computer-Aided Way to Prove Theorems in Scheduling , 1998, ESA.

[2] Gerhard J. Woeginger,et al. Makespan minimization in open shops: A polynomial time approximation scheme , 1998, Math. Program..

[3] Han Hoogeveen,et al. Short Shop Schedules , 1997, Oper. Res..

[4] Gerhard J. Woeginger,et al. Approximation algorithms for the multiprocessor open shop scheduling problem , 1999, Oper. Res. Lett..

[5] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .

[6] Alekseii D. Korshunov. Discrete Analysis and Operations Research , 1995 .

[7] S. V. Sevast’yanov. Efficient Scheduling in Open Shops , 1996 .