|
|||||
|
|
Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time |
|
| Authors: | |
| Institution: | (1) CNRS LIX, Ecole Polytechnique, F-91128, Palaiseau |
| Abstract: | |
| Keywords: | Scheduling Parallel machine Flowshop Complexity |
| 本文献已被 SpringerLink 等数据库收录！ | |