Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times.
Luis Fanjul-PeyroRubén RuizFederico PereaPublished in: Comput. Oper. Res. (2019)
Keyphrases
- setup times
- parallel machine scheduling problem
- scheduling problem
- sequence dependent setup times
- single machine
- total weighted tardiness
- parallel machines
- release dates
- branch and bound algorithm
- flowshop
- processing times
- lagrangian relaxation
- single machine scheduling problem
- precedence constraints
- column generation
- integer programming
- lot sizing
- tabu search
- np hard
- job shop scheduling problem
- multi item
- single server
- job shop
- lower bound
- genetic algorithm
- parallel computing
- feasible solution
- branch and bound
- special case
- evolutionary algorithm