Precedence constrained parallel-machine scheduling of position-dependent jobs |
| |
Authors: | Bartłomiej Przybylski |
| |
Institution: | 1.Faculty of Mathematics and Computer Science,Adam Mickiewicz University in Poznan,Poznan,Poland |
| |
Abstract: | We consider parallel-machine job scheduling problems with precedence constraints. Job processing times are variable and depend on positions of jobs in a schedule. The objective is to minimize the maximum completion time or the total weighted completion time. We specify certain conditions under which the problem can be solved by scheduling algorithms applied earlier for fixed job processing times. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|