A Supermodular Relaxation for Scheduling with Release Dates.
Michel X. GoemansPublished in: IPCO (1996)
Keyphrases
- release dates
- single machine
- single machine scheduling problem
- scheduling problem
- minimize total
- precedence constraints
- parallel machines
- processing times
- sequence dependent setup times
- maximum lateness
- combinatorial optimization
- lagrangian relaxation
- setup times
- branch and bound algorithm
- scheduling jobs
- identical parallel machines
- strongly np hard
- particle swarm optimization
- resource consumption
- dynamic programming
- optimal solution