Scheduling unit processing time arc shutdown jobs to maximize network flow over time: complexity results.
Natashia BolandThomas KalinowskiReena KapoorSimranjit KaurPublished in: CoRR (2013)
Keyphrases
- network flow
- network flow problem
- parallel machines
- identical machines
- minimum cost
- integer programming
- scheduling problem
- identical parallel machines
- release dates
- optimal scheduling
- job scheduling
- min cost
- processing times
- single machine
- optimization model
- minimize total
- release times
- deteriorating jobs
- scheduling strategy
- precedence constraints
- linear programming
- computational grids
- wafer fabrication
- scheduling jobs
- worst case
- unrelated parallel machines
- batch processing
- scheduling policies
- single machine scheduling problem
- np hard
- computational complexity