讨论带有公共工期且加工时间依赖与有关的位置负荷和资源的单机排序问题。工件的加工时间是一个和资源分配、工件在排序中的位置以及负荷有关的凸函数，所有任务具有一个公共工期。目标是确定最优工期的位置、分配给每个工件的资源和最优的工件排序，最小化由提前、误工、工期、资源分配构成的总费用。应用指派问题解法给出了时间复杂度为O(n3)的最优算法。

We consider a common due-date assignment and single machine scheduling problem in which job processing time has position-dependent workload. Assume that the processing time of a job is a convex function of the amount of a resource allocated to it, its position in the processing sequence and workload. All jobs have a common due date. The objective is to find the optimal due date, the optimal resource allocation scheme and the optimal job sequence so as to minimize the total cost, which is a function of earliness, tardiness, due-date, resource consumption. We introduce an efficient O(n3)algorithm to solve the problem.