One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints.
Adam JaniakPublished in: Kybernetika (1987)
Keyphrases
- precedence constraints
- resource allocation
- scheduling problem
- branch and bound algorithm
- allocation scheme
- precedence relations
- vertex cover
- allocation policies
- approximation algorithms
- parallel machines
- sequence dependent setup times
- envy free
- parallel processors
- single machine scheduling problem
- maximum lateness
- global constraints
- release dates
- partially ordered
- unit length
- partially ordered sets
- resource constraints
- partial order
- lower bound
- series parallel
- allocation policy
- resource consumption
- single machine
- np hard
- optimal solution
- genetic algorithm
- processing times
- special case
- pairwise
- objective function