Just-in-Time Batch Scheduling Problem with Two-dimensional Bin Packing Constraints.
Sergey PolyakovskiyAlexander MakarowskyRym M'HallahPublished in: CoRR (2017)
Keyphrases
- bin packing
- scheduling problem
- packing problem
- graph colouring
- assembly line balancing
- single machine
- three dimensional
- search tree
- cutting stock
- precedence constraints
- global constraints
- multiple knapsack
- flowshop
- constraint programming
- constraint satisfaction
- setup times
- multi dimensional
- combinatorial problems
- tabu search
- dynamic programming