Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times.
Pedro Leite RochaMartín Gómez RavettiGeraldo Robson MateusPanos M. PardalosPublished in: Comput. Oper. Res. (2008)
Keyphrases
- unrelated parallel machines
- setup times
- exact algorithms
- scheduling problem
- flowshop
- parallel machines
- single machine
- approximation algorithms
- np hard
- knapsack problem
- processing times
- sequence dependent setup times
- exact solution
- strongly np hard
- multi item
- lot sizing
- precedence constraints
- combinatorial optimization
- special case
- combinatorial optimization problems
- single machine scheduling problem
- tabu search
- job shop scheduling problem
- scheduling jobs
- markov chain
- dynamic programming
- job shop
- column generation