极小化两种目标函数的具有学习效应的单机排序问题

摘要

In this paper ,we study single-machine scheduling problems with learning and forgetting effects in intermittent batch production. The objective functions of the problem are to minimize the makespan and total completion time respectively. There are three cases of no transmission, partial transmission and total transmission of the learning effects from batch to batch. We provide polynomial-time algorithm for the problems and thus the optimality of the algorithm.%本文研究具有学习效应和遗忘效应的间歇批生产的单机排序问题，目标函数分别为极小化最大完工时间和总完工时间．考虑了批与批之间没有学习效应的传递、批与批之间有部分学习效应的传递、批与批之间有总的学习效应的传递三种情形．我们分别对所考虑的问题给出了多项式时间算法并且证明了算法的最优性．