Scheduling Non-Preemptible Jobs to Minimize Peak Demand.
Sean YawBrendan MumeyPublished in: Algorithms (2017)
Keyphrases
- minimize total
- completion times
- job processing times
- single machine
- scheduling problem
- release dates
- parallel machines
- tardiness cost
- processing times
- weighted tardiness
- identical machines
- identical parallel machines
- lead time
- unrelated parallel machines
- release times
- job scheduling
- scheduling strategy
- total cost
- flowshop
- scheduling jobs
- precedence constraints
- optimal scheduling
- deteriorating jobs
- batch processing
- maximum lateness
- setup times
- wafer fabrication
- single machine scheduling problem
- scheduling algorithm
- precedence relations
- weighted sum
- holding cost
- inventory level
- computational grids
- batch processing machines
- scheduling policies
- batch size
- scheduling decisions
- total weighted tardiness
- sequence dependent setup times
- dynamic pricing
- round robin
- planning horizon
- competitive ratio
- lot size
- capacity allocation
- production scheduling
- setup cost
- fixed number