Two-dedicated-machine scheduling problem with precedence relations to minimize makespan |
| |
| Authors: | Evgeny Gafarov Alexandre Dolgui |
| |
| Institution: | 1. Ecole Nationale Superieure des Mines, CNRS UMR6158, LIMOS, 42023, Saint-Etienne, France
2. Institute of Control Sciences of the Russian Academy of Sciences, Profsoyuznaya St. 65, Moscow, 117997, Russia
|
| |
| Abstract: | Two-dedicated-parallel-machine scheduling problem with precedence constraints to minimize makespan is considered. This problem originally appeared as a sub-problem in assembly line balancing but it has also its own applications. Complexity and approximation results for this scheduling problem and its special cases with chains of jobs or equal-processing-times are presented. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
