双条形图装箱问题
Two-Bar Charts Packing Problem
摘要:
本文考虑一个条形图装箱问题(BCPP),其中需要将条形图(BC)装箱成最小长度的长条。该问题一方面是装箱问题(BPP)的推广,另一方面也是具有多学科作业和有限非累积资源的项目调度问题的特例。在前面,我们提出了一个多项式算法,该算法为给定的非递增BC阶数构造最优包。这一结果推广了BPP的一个类似结果。对于双条形图装箱问题(2-BCPP),当每个BC由两个条形图组成时,我们提出的算法在多项式时间内构造一个长度不超过$2\ OPT+1$的装箱,其中$OPT$是装箱的最小可能长度。据我们所知,这是2-BCPP的第一个有保证的估计。我们还进行了一个数值实验中,我们比较了我们的近似算法建立的解决方案与CPLEX包建立的最佳解决方案。实验结果证实了所开发的算法的高效率。
英文摘要:
We consider a Bar Charts Packing Problem (BCPP), in which it is necessary to pack bar charts (BCs) in a strip of minimum length. The problem is, on the one hand, a generalization of the Bin Packing Problem (BPP), and, on the other hand, a particular case of the Project Scheduling Problem with multidisciplinary jobs and one limited non-accumulative resource. Earlier, we proposed a polynomial algorithm that constructs the optimal package for a given order of non-increasing BCs. This result generalizes a similar result for BPP. For Two-Bar Charts Packing Problem (2-BCPP), when each BC consists of two bars, the algorithm we have proposed constructs a package in polynomial time, the length of which does not exceed $2\ OPT+1$, where $OPT$ is the minimum possible length of the packing. As far as we know, this is the first guaranteed estimate for 2-BCPP. We also conducted a numerical experiment in which we compared the solutions built by our approximate algorithms with the optimal solutions built by the CPLEX package. The experimental results confirmed the high efficiency of the developed algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。