文献类型：期刊文献

英文题名：A container bin packing algorithm for multiple objects

作者：Luo, Fei[1]; Gu, Chunhua[1]; Fang, Xu[1]; Tang, Yi[2]

机构：[1] School of Information and Engineering, East China University of Science and Technology, Shanghai, China; [2] Shanghai ChinaNetCenter Development Co., Ltd, Shanghai, China

年份：2015

卷号：9226

起止页码：124

外文期刊名：Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

收录：EI(收录号：20154301446949)

语种：英文

摘要：The bin packing problem considered in this paper has the character with items arriving in batches, such as the task dispatching process in the cloud. The problem has two packing objects, one of which is to minimize the number of used bins, and the other is to reduce the packing time. To meet the objects, a container packing algorithm is presented, which consists of rounds of packing. In one round the number of the necessary bins is first calculated, and those bins are opened in batch to pack items in parallel. This round will be iterated until there are no unpacked items. The proposed algorithm is compared with other classical bin packing algorithms through experiments, which have the same property of simplicity for implementation. It is shown that the novel algorithm not only saves the packing time, but also achieves better combined performance than others. ? Springer International Publishing Switzerland 2015.