Scheduling semi-malleable jobs to minimize mean flow time.
Yann HendelWieslaw KubiakDenis TrystramPublished in: J. Sched. (2015)
Keyphrases
- minimize total
- completion times
- job processing times
- release dates
- scheduling problem
- single machine
- parallel machines
- processing times
- identical parallel machines
- unrelated parallel machines
- job scheduling
- weighted tardiness
- single machine scheduling problem
- identical machines
- flowshop
- precedence constraints
- release times
- scheduling strategy
- optimal scheduling
- deteriorating jobs
- sequence dependent setup times
- precedence relations
- tardiness cost
- scheduling jobs
- total cost
- fixed number
- flow patterns
- wafer fabrication
- setup times
- scheduling algorithm
- maximum lateness
- computational grids
- open shop
- weighted sum
- list scheduling
- scheduling decisions
- batch processing machines
- total weighted tardiness
- batch processing
- resource constrained project scheduling problem
- queue length
- scheduling policies
- flow field
- strongly np hard
- competitive ratio
- round robin
- single server
- resource constraints
- tabu search
- response time
- dynamic programming