论文部分内容阅读
等待时间受限的流水车间调度问题广泛存在于高温连续作业或中间产品不稳定的流水车间生产管理过程中,要求工件在相邻机器上的等待时间不能超过一定的上限.针对以最小化最大完工时间为目标函数的该类问题,研究了加工机器上的工件序列特征,并在此基础上分析了基于排列排序进行问题求解的可行性和有效性,为算法求解提供了理论依据.
Waiting time-constrained flowshop scheduling problems exist widely in the high-temperature continuous operation or instability of the intermediate product flowshop production management process, the workpiece on the adjacent machine required the waiting time can not exceed a certain upper limit.For minimizing the maximum completion Time as the objective function of the type of problem, the processing machine on the characteristics of the workpiece sequence, and on this basis, analysis based on the arrangement of order to solve the feasibility and effectiveness of the problem for the algorithm to provide a theoretical basis.