A Lagrangian decomposition approach for the pump scheduling problem in water networks.
Bissan GhaddarJoe Naoum-SawayaAkihiro KishimotoNicole TaheriBradley EckPublished in: Eur. J. Oper. Res. (2015)
Keyphrases
- scheduling problem
- high pressure
- single machine
- flowshop
- tabu search
- precedence constraints
- network structure
- setup times
- network design
- parallel machines
- network analysis
- processing times
- feasible solution
- lagrangian relaxation
- computer networks
- complex networks
- differential equations
- decomposition method
- decomposition algorithm
- decomposition methods
- maximum lateness
- permutation flowshop
- total tardiness
- lower bound