Approximation algorithms for makespan minimization on identical parallel machines under resource constraints.
Vitaly A. StrusevichPublished in: J. Oper. Res. Soc. (2021)
Keyphrases
- resource constraints
- approximation algorithms
- processing times
- strongly np hard
- polynomial time approximation
- release dates
- scheduling problem
- np hard
- precedence constraints
- parallel machines
- special case
- resource constrained
- single machine
- flowshop
- minimum cost
- worst case
- temporal constraints
- single machine scheduling problem
- single server
- approximation ratio
- routing problem
- competitive ratio
- constant factor
- job shop scheduling problem
- sequence dependent setup times
- setup times
- resource consumption
- np complete
- combinatorial auctions
- error bounds
- tabu search
- metaheuristic