Scheduling assembly tasks with caterpillar precedence constraints on dedicated machines.
Gaia NicosiaAndrea PacificiPublished in: Int. J. Prod. Res. (2017)
Keyphrases
- precedence constraints
- parallel machines
- scheduling problem
- identical machines
- parallel processors
- flowshop
- release dates
- precedence relations
- branch and bound algorithm
- maximum lateness
- sequence dependent setup times
- setup times
- vertex cover
- approximation algorithms
- identical parallel machines
- partial order
- single machine scheduling problem
- total tardiness
- series parallel
- unit length
- partially ordered sets
- global constraints
- partially ordered
- processing times
- single machine
- tabu search
- scheduling jobs
- lower bound
- optimal solution
- job shop scheduling problem
- shared memory
- genetic algorithm
- branch and bound
- upper bound