题目
Problem
The list of numbers shown below represents the masses, in kg, of nine items that are to be moved from one factory to another.
The items will all be moved, by van, at the same time.
Each van can carry at most 600 kg.
(a) Calculate a lower bound for the number of vans required.
(2)
(b) Use the first-fit bin-packing algorithm to allocate the items to vans.
(2)
题目中文翻译
下面的数字列表表示待从一个工厂运送到另一个工厂的九件物品的质量(单位:kg)。
所有物品将同时用货车运送。
每辆货车最多可装载 600 kg。
(a) 计算所需货车数量的下界。
(b) 使用首次适应装箱算法将物品分配到货车。