Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies.
Natashia BolandThomas KalinowskiSimranjit KaurPublished in: Comput. Oper. Res. (2015)
Keyphrases
- release dates
- job processing times
- release times
- single machine
- single machine scheduling problem
- processing times
- scheduling problem
- minimize total
- precedence constraints
- parallel machines
- identical parallel machines
- sequence dependent setup times
- maximum lateness
- scheduling jobs
- parallel machine scheduling problem
- completion times
- branch and bound algorithm
- resource consumption
- lower bound
- setup times
- search procedure
- network flow
- response time
- optimal solution
- lagrangian relaxation
- identical machines
- upper bound
- integer programming
- flowshop
- scheduling algorithm
- partial order
- dynamic programming
- np hard