Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints.
Wei HanJulia A. BennellXiaozhou ZhaoXiang SongPublished in: Eur. J. Oper. Res. (2013)
Keyphrases
- bin packing
- graph colouring
- packing problem
- arbitrarily shaped
- assembly line balancing
- three dimensional
- search tree
- multiple knapsack
- search algorithm
- shape analysis
- combinatorial problems
- cutting stock
- tabu search
- round robin
- knapsack problem
- three dimensional objects
- timetabling problem
- multi dimensional
- irregular isothetic grids
- constraint programming
- shape model
- constraint satisfaction
- data management
- np hard
- computational complexity