A batching-move iterated local search algorithm for the bin packing problem with generalized precedence constraints.
Raphael KramerMauro Dell'AmicoManuel IoriPublished in: Int. J. Prod. Res. (2017)
Keyphrases
- precedence constraints
- search algorithm
- scheduling problem
- branch and bound algorithm
- branch and bound
- release dates
- precedence relations
- parallel machines
- approximation algorithms
- vertex cover
- global constraints
- series parallel
- setup times
- single machine scheduling problem
- partial order
- sequence dependent setup times
- maximum lateness
- single machine
- parallel processors
- lower bound
- partially ordered
- tabu search
- np hard
- search space
- partially ordered sets
- unit length
- processing times
- flowshop
- upper bound
- dynamic programming