Heuristic placement routines for two-dimensional bin packing problem.

Problem statement: Cutting and packing (C and P) problems are optimization problems that are concerned in finding a good arrangement of multiple small items into one or more larger objects. Bin packing problem is a type of C AND P problems. Bin packing problem is an important industrial problem wher...

Full description

Saved in:
Bibliographic Details
Main Authors: Wong, L., Lee, Lai Soon
Format: Article
Language:English
English
Published: Science Publications 2009
Online Access:http://psasir.upm.edu.my/id/eprint/14998/1/Heuristic%20placement%20routines%20for%20two.pdf
http://psasir.upm.edu.my/id/eprint/14998/
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Putra Malaysia
Language: English
English