Exact and heuristic methods for a workload allocation problem with chain precedence constraints.
Jordi PereiraMarcus RittPublished in: Eur. J. Oper. Res. (2023)
Keyphrases
- heuristic methods
- precedence constraints
- scheduling problem
- tabu search
- partially ordered sets
- branch and bound algorithm
- optimal solution
- precedence relations
- parallel machines
- vertex cover
- approximation algorithms
- release dates
- single machine scheduling problem
- sequence dependent setup times
- partial order
- global constraints
- maximum lateness
- single machine
- partially ordered
- response time
- upper bound
- exact solution
- processing times
- lower bound
- np hard
- parallel processors
- variable neighborhood search
- series parallel
- neighborhood search
- job shop scheduling problem
- unit length
- neural network
- exact methods
- flowshop
- multi dimensional
- search space
- branch and bound