Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines.
Arthur KramerMauro Dell'AmicoManuel IoriPublished in: Eur. J. Oper. Res. (2019)
Keyphrases
- processing times
- identical parallel machines
- minimize total
- single machine
- release dates
- scheduling problem
- completion times
- flowshop
- parallel machines
- competitive ratio
- strongly np hard
- fixed number
- setup times
- resource consumption
- single machine scheduling problem
- precedence constraints
- sequence dependent setup times
- single server
- valid inequalities
- total cost
- dynamic programming