Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines.
Arthur KramerMauro Dell'AmicoManuel IoriPublished in: CoRR (2018)
Keyphrases
- processing times
- identical parallel machines
- minimize total
- single machine
- scheduling problem
- release dates
- completion times
- flowshop
- parallel machines
- competitive ratio
- single machine scheduling problem
- strongly np hard
- setup times
- precedence constraints
- single server
- sequence dependent setup times
- tabu search
- genetic algorithm
- particle swarm optimization
- linear programming
- dynamic programming
- special case