配送时间有学习效应的单机排序问题

Single Machine Scheduling Problems with Learning Effect in Delivery Times

提出一种带有配送时间的单机排序问题,配送时间具有学习效应,目标为极小化总配送完成时间.证明了两个特殊情形下的最优序;分析一般情形下排序问题的性质,并由此得到一致性条件下该问题的最优序.

This study proposes a single machine scheduling problem with delivery times which has learning effect. The objective is to minimize the total completion time distribution. It proves the optimal sequences in two special cases. It also analyzes the scheduling problem natures under general situation and gets the optimal sequence of the problem under consistent condition.