Just-in-time batch scheduling problem with two-dimensional bin packing constraints.
Sergey PolyakovskiyAlexander MakarowskyRym M'HallahPublished in: GECCO (2017)
Keyphrases
- bin packing
- scheduling problem
- packing problem
- graph colouring
- assembly line balancing
- flowshop
- search tree
- single machine
- tabu search
- multi dimensional
- processing times
- cutting stock
- precedence constraints
- three dimensional
- constraint satisfaction
- np hard
- multiple knapsack
- minimizing makespan
- parallel machines
- evolutionary algorithm