论文部分内容阅读
针对两机无等待流水车间调度问题,提出目标函数最大完工时间最小化的快速算法,并给出算法的复杂度.分析两机无等待流水车间调度问题的排列排序性质,证明了两机无等待流水车间调度问题的可行解只存在于排列排序中,排列排序的最优解一定是两机无等待流水车间调度问题的最优解.最后研究了同时包含普通工件和无等待工件的两机流水车间调度问题的复杂性,为进一步研究两机无等待流水车间调度问题提供了理论依据.
Aiming at the problem of two-machine non-waiting flow shop scheduling problem, a fast algorithm is proposed to minimize the maximum completion time of the objective function, and the complexity of the algorithm is given.Analyzing the sorting nature of the two-machine non-waiting flow shop scheduling problem, The feasible solution of the flow shop scheduling problem exists only in the permutation order, and the optimal solution of permutation order must be the optimal solution of the two-machine non-waiting flow shop scheduling problem.Finally, The complexity of the shop scheduling problem provides a theoretical basis for further research on the two-machine shop scheduling problem without waiting.