A PTAS for a resource scheduling problem with arbitrary number of parallel machines.
Péter GyörgyiPublished in: Oper. Res. Lett. (2017)
Keyphrases
- total tardiness
- scheduling problem
- parallel machines
- single machine
- setup times
- sequence dependent setup times
- earliness tardiness
- np hard
- unrelated parallel machines
- processing times
- precedence constraints
- massively parallel
- makespan minimization
- maximum lateness
- lower bound
- fixed number
- dynamic programming
- approximation schemes
- single server
- genetic algorithm