Analysis and Comparison of Various Algorithms on Bin Packing Problem with Variable Bin Size and LIB Constraint
碩士 === 國立成功大學 === 數學系應用數學碩博士班 === 94 === In this thesis, we study the online bin packing problem with variable bin sizes. Based on the safety and stability requirement during the shipment, longer(heavier) items should be placed at the bottom of a bin and can not be placed anywhere above the shorter(...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/15900131959059560916 |