Solvable cases of the flow-shop problem without interruptions in job processing |
| |
Authors: | Wlodzimierz Szwarc |
| |
Abstract: | This article examines solvable cases of the flow-shop problem without interruptions in job processing where the completion time is being minimized. All those cases utilize Gilmore-Gomory's algorithm. A lower completion time bound is also provided. |
| |
Keywords: | |
|
|