Reducing Tardiness under Global Scheduling by Splitting Jobs.
Jeremy P. EricksonJames H. AndersonPublished in: ECRTS (2013)
Keyphrases
- minimize total
- parallel machines
- scheduling problem
- scheduling jobs
- processing times
- single machine
- single machine scheduling problem
- release dates
- number of tardy jobs
- sequence dependent setup times
- flowshop
- identical parallel machines
- weighted tardiness
- identical machines
- precedence constraints
- release times
- unrelated parallel machines
- maximum lateness
- single machine scheduling
- setup times
- precedence relations
- production system
- tardiness penalties
- total cost
- wafer fabrication
- batch processing
- total weighted tardiness
- branch and bound algorithm
- scheduling strategy
- job scheduling
- strongly np hard
- special case
- scheduling policies
- resource consumption
- optimal scheduling
- np hard
- scheduling algorithm
- lot sizing
- job shop
- fixed number
- resource constraints
- job shop scheduling problem
- computational grids
- list scheduling