Two-dedicated-machine scheduling problem with precedence relations to minimize makespan.
Evgeny R. GafarovAlexandre DolguiPublished in: Optim. Lett. (2014)
Keyphrases
- precedence relations
- scheduling problem
- flowshop
- precedence constraints
- processing times
- makespan minimization
- sequence dependent setup times
- parallel machines
- single machine
- setup times
- release dates
- np hard
- single machine scheduling problem
- tabu search
- total weighted tardiness
- job shop scheduling problem
- special case
- branch and bound algorithm
- job shop
- resource constrained project scheduling problem
- global optimization