研究了工件带与加工次序有关的安装时间的平行机排序问题,给出它的整数规划模型,并结合动态规划和分支定界方法,给出它的列生成算法.通过试验表明:算法对中等规模的问题是有效的,它可以计算到10台机器和60个工件甚至含有更多大工件的大规模问题.
In this paper we address the problem of scheduling jobs on identical parallel machines with sequence- dependent setup times to minimize the total weighted completion times. This problem is complicated to such an extent that it is NP-hard in some special cases. We formulate the problem as an integer program, and a column generation algorithm is given then. Our computational results show that this column generation algorithm is capable of solving problems with up to 10 machines and 60 jobs in reasonable computational time.