具有恶化效应与可控加工时间的工期指派排序问题研究

Research on due date assignment scheduling with deterioration effect and controllable processing times

研究工件同时具有恶化效应与可控加工时间的单机排序问题,其中工件的加工时间与其开工时间和所用资源都有关系。在共同工期和松弛工期指派方法下,目标是确定工件的最优排序、最优资源分配和共同工期(松弛工期)使所有工件的排序费用(包括提前时间、延误时间、共同工期(松弛工期))和资源的消耗费用的线性加权和最小。对此问题给出了一些性质,并证明了此问题可以多项式时间内解决。

This paper considers a single-machine scheduling problem with simultaneous considerations of deterioration effect and controllable processing times,where the processing time of a job is a function of its starting time and resources consumed.Under the common due date and slack due date assignment methods,the objective is to determine the optimal schedule of jobs,optimal resource allocation and optimal common due date(slack due date)such that the linear weighted sum of scheduling cost(including the earliness,tardiness and common due date(slack due date))and total resource consumption cost is minimized.Some properties are given,which shows that the problem can be solved in polynomial time.