Near-Optimal Solutions and Large Integrality Gaps for Almost All Instances of Single-Machine Precedence-Constrained Scheduling.
Andreas S. SchulzNelson A. UhanPublished in: Math. Oper. Res. (2011)
Keyphrases
- single machine
- scheduling problem
- minimize total
- release dates
- maximum lateness
- release times
- scheduling jobs
- weighted tardiness
- sequence dependent setup times
- processing times
- deteriorating jobs
- total weighted tardiness
- benchmark instances
- rolling horizon
- earliness tardiness
- tabu search
- identical machines
- parallel machines
- setup times
- single machine scheduling problem
- production scheduling
- learning effect
- flowshop
- precedence constraints
- completion times
- job shop
- np hard
- competitive ratio
- optimal solution
- linear programming relaxation
- dynamic programming
- job processing times
- weighted number of tardy jobs
- number of late jobs
- job shop scheduling
- job shop scheduling problem
- solution quality
- identical parallel machines
- benchmark problems