A QPTAS for the General Scheduling Problem with Identical Release Dates.
Antonios AntoniadisRuben HoeksmaJulie MeißnerJosé VerschaeAndreas WiesePublished in: ICALP (2017)
Keyphrases
- scheduling problem
- release dates
- single machine
- processing times
- precedence constraints
- single machine scheduling problem
- earliness tardiness
- sequence dependent setup times
- parallel machines
- setup times
- maximum lateness
- parallel machine scheduling problem
- special case
- flowshop
- tabu search
- np hard
- total weighted tardiness
- lower bound
- branch and bound algorithm
- upper bound