An improved approximation scheme for the Johnson problem with parallel machines |
| |
| Authors: | S. V. Sevastyanov |
| |
| Affiliation: | (1) Sobolev Institute of Mathematics, pr. Akad. Koptyuga 4, Novosibirsk, 630090, Russia |
| |
| Abstract: | An extension of the NP-hard Johnson problem to the case of identical parallel machines at each stage is considered. When the number of stages is bounded by a constant and the number of machines is part of the input, a new polynomial time approximation scheme with an improved bound on the running time is designed. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
