A polynomially solvable case of the three machine johnson problem |
| |
Authors: | V V Servakh |
| |
Institution: | (1) Sobolev Institute of Mathematics, Omsk Branch, ul. Pevtsova 13, Omsk, 644099, Russia |
| |
Abstract: | Under study is the classical NP-hard problem with three machines: N tasks must be fulfilled at three machines in minimum time. The processing time is given of each task at each machine. The processing sequences of all tasks are identical. It is impossible to process two tasks at one machine at the same time. We address the properties of this problem, find a new polynomially solvable case, and discuss a corresponding algorithm. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|