Strong LP formulations for scheduling splittable jobs on unrelated machines.
José R. CorreaAlberto Marchetti-SpaccamelaJannik MatuschkeLeen StougieOla SvenssonVíctor VerdugoJosé VerschaePublished in: Math. Program. (2015)
Keyphrases
- identical parallel machines
- identical machines
- parallel machines
- scheduling problem
- processing times
- flowshop
- wafer fabrication
- fixed number
- unrelated parallel machines
- scheduling jobs
- single machine
- release dates
- scheduling decisions
- job scheduling
- sequence dependent setup times
- parallel machine scheduling problem
- minimize total
- precedence constraints
- setup times
- competitive ratio
- single server
- linear programming
- np hard
- scheduling algorithm
- valid inequalities
- linear program
- weighted tardiness
- optimal scheduling
- scheduling strategy
- dispatching rule
- computational grids
- list scheduling
- strongly np hard
- polynomial time approximation
- batch processing
- optimization methods
- special case
- deteriorating jobs
- flexible manufacturing systems
- production scheduling
- precedence relations
- round robin
- tabu search
- objective function