Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints.
Alberto García-VilloriaAlbert CorominasAdrià NadalRafael PastorPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- precedence constraints
- assembly line
- scheduling problem
- branch and bound algorithm
- parallel machines
- approximation algorithms
- precedence relations
- vertex cover
- single machine scheduling problem
- global constraints
- partial order
- partially ordered
- combinatorial optimization
- lower bound
- processing times
- beam search
- branch and bound
- particle swarm optimization
- objective function