|
|||||
|
|
Open-shop scheduling problems with dominated machines |
|
| Authors: | I Adiri N Aizikowitz |
| Institution: | I. Adiri,N. Aizikowitz (Hefetz) |
| Abstract: | This article deals with special cases of open-shop scheduling where n jobs have to be processed by m, m ?3, machines to minimize the schedule length. The main result obtained is an O(n) algorithm for the three-machine problem with a dominated machine. |
| Keywords: | |