Scheduling problems for parallel dedicated machines under multiple resource constraints

https://doi.org/10.1016/S0166-218X(03)00433-5Get rights and content
Under an Elsevier user license
open archive

Abstract

The paper considers scheduling problems for parallel dedicated machines subject to resource constraints. A fairly complete computational complexity classification is obtained, a number of polynomial-time algorithms are designed. For the problem with a fixed number of machines in which a job uses at most one resource of unit size a polynomial-time approximation scheme is offered.

Keywords

Scheduling
Parallel dedicated machines
Resource constraints
Complexity
Approximation

Cited by (0)