Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines.
José R. CorreaAlberto Marchetti-SpaccamelaJannik MatuschkeLeen StougieOla SvenssonVictor VerdugoJosé VerschaePublished in: IPCO (2014)
Keyphrases
- identical machines
- identical parallel machines
- parallel machines
- scheduling problem
- processing times
- wafer fabrication
- flowshop
- fixed number
- single machine
- release dates
- job scheduling
- unrelated parallel machines
- scheduling jobs
- precedence constraints
- sequence dependent setup times
- np hard
- linear programming
- minimize total
- scheduling decisions
- maximum lateness
- weighted tardiness
- competitive ratio
- strongly np hard
- single server
- scheduling strategy
- optimization methods
- linear program
- parallel machine scheduling problem
- single machine scheduling problem
- dispatching rule
- setup times
- parallel computing
- precedence relations
- scheduling policies
- valid inequalities
- scheduling algorithm
- resource allocation
- optimal scheduling
- job shop
- release times
- special case