中文摘要：

研究了工期可指派且机器具有学习效应的单机成组排序问题．机器具有与位置和工件都有关学习效应．同一个组的所有工件在机器上连续加工且每个组在加工之前都有一个组安装时间．工件有两种工期指派规则分别是FML—CON和FML—SLK．目标是确定所有组的加工顺序以及每个组内工件的加工顺序，再对每个工件指派最优工期使所有工件的工期指派费用，提前、延误费用以及总流程时间之和达到最小．本文分别对两种工期指派下的问题做了详细的分析，并给出多项式时间最优算法．另外，对一种具有特殊的学习效应模型的问题，给出0（nlogn）时间最优算法．

英文摘要：

In this paper, we consider a single-machine scheduling problem involving learning effects, due date assignment and job scheduling under a group technology environment. The learning effect is job-dependent and po- sition-dependent. To achieve production efficiency and save time/money resource, all jobs of the same group are required to be processed contiguously on the machine. A sequence-independent setup time precedes the processing of each group. The due dates are assignable according to one of the following two due date assignment methods： FML-CON and FML-SLK. The goal is to determine an optimal combination of the due date assignment strategy and job schedule so as to minimize objective function that includes earliness, tardiness, due date assignment and flow time costs. A unified optimization algorithm is provided for all of the above two due date assignment methods. For a special case, we show that they can be solved optimally in O（nlogn） time.