Precedence-Constrained Scheduling of Malleable Jobs with Preemption.
Konstantin MakarychevDebmalya PanigrahiPublished in: ICALP (1) (2014)
Keyphrases
- parallel machines
- batch processing
- unrelated parallel machines
- scheduling problem
- minimize total
- sequence dependent setup times
- identical parallel machines
- release dates
- scheduling jobs
- weighted tardiness
- precedence constraints
- identical machines
- maximum lateness
- completion times
- job scheduling
- release times
- scheduling strategy
- processing times
- flowshop
- list scheduling
- single machine
- optimal scheduling
- parallel computing
- shared memory
- open shop
- setup times
- computational grids
- deteriorating jobs
- scheduling algorithm
- wafer fabrication
- np hard
- single server
- job shop scheduling problem
- resource allocation
- precedence relations
- job shop
- branch and bound algorithm
- neural network
- batch processing machines