Modelling and symmetry breaking in scheduling problems on batch processing machines.
Renan Spencer TrindadeOlinto César Bassi de AraújoMarcia Helena Costa FampaFelipe Martins MüllerPublished in: Int. J. Prod. Res. (2018)
Keyphrases
- symmetry breaking
- scheduling problem
- maximum lateness
- batch processing machines
- single machine
- graph coloring
- constraint programming
- flowshop
- precedence constraints
- global constraints
- job shop scheduling
- np hard
- search tree
- release dates
- parallel machines
- sequence dependent setup times
- processing times
- integer linear programming
- tabu search
- constraint satisfaction problems
- job shop scheduling problem
- setup times
- symmetry breaking constraints
- single machine scheduling problem
- integer programming
- combinatorial problems
- traveling salesman problem
- np complete
- dynamic programming