A linear time approximation scheme for makespan minimization in an open shop with release dates.
Alexander V. KononovMaxim SviridenkoPublished in: Oper. Res. Lett. (2002)
Keyphrases
- makespan minimization
- polynomial time approximation
- approximation algorithms
- release dates
- np hard
- worst case
- precedence constraints
- job shop
- special case
- parallel machines
- minimum cost
- scheduling problem
- processing times
- single machine scheduling problem
- single machine
- sequence dependent setup times
- global constraints