Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint.
Joachim BreitPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- single machine
- scheduling problem
- minimize total
- release dates
- release times
- maximum lateness
- scheduling jobs
- processing times
- sequence dependent setup times
- weighted tardiness
- setup times
- rolling horizon
- identical machines
- total weighted tardiness
- earliness tardiness
- production scheduling
- total tardiness
- learning effect
- np hard
- deteriorating jobs
- job shop scheduling
- precedence constraints
- parallel machines
- flowshop
- number of late jobs
- dynamic programming
- tabu search
- competitive ratio
- job shop scheduling problem
- single machine scheduling problem
- job processing times
- weighted number of tardy jobs
- completion times
- resource constraints
- global constraints
- approximation algorithms
- scheduling algorithm
- identical parallel machines
- special case