Scheduling Non-Unit Jobs to Minimize Calibrations.
Jeremy T. FinemanBrendan SheridanPublished in: SPAA (2015)
Keyphrases
- minimize total
- completion times
- job processing times
- release dates
- scheduling problem
- single machine
- parallel machines
- weighted tardiness
- processing times
- identical parallel machines
- flowshop
- release times
- identical machines
- unrelated parallel machines
- scheduling strategy
- job scheduling
- tardiness cost
- optimal scheduling
- single machine scheduling problem
- precedence constraints
- total cost
- maximum lateness
- scheduling jobs
- scheduling algorithm
- deteriorating jobs
- scheduling policies
- wafer fabrication
- sequence dependent setup times
- batch processing
- setup times
- computational grids
- scheduling decisions
- precedence relations
- batch processing machines
- fixed number
- resource allocation
- open shop
- job shop
- resource constraints
- weighted sum
- limited capacity
- round robin
- dynamic programming
- np hard