Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization.
Arthur KramerManuel IoriPhilippe LacommePublished in: Eur. J. Oper. Res. (2021)
Keyphrases
- setup times
- scheduling jobs
- identical parallel machines
- processing times
- scheduling problem
- strongly np hard
- single machine
- single server
- parallel machines
- flowshop
- release dates
- sequence dependent setup times
- special case
- single machine scheduling problem
- precedence constraints
- lot sizing
- objective function
- competitive ratio
- np hard
- tabu search
- multi item
- identical machines
- finite number