具有公共流、退化效应与维护和资源分配的单机窗口排序问题

A Single-machine due-window assignment scheduling based on common flow allowance with deteriorating effect,maintenance activity and resource allocation

考虑具有公共流、退化效应与维护和资源分配的单机窗口排序问题,所有任务都具有松弛窗口。在实际加工过程中,为提高生产效率,提供给每个任务不同的资源,资源总量有限,并适时对机器进行维护,一旦维护活动结束,机器恢复到最初状态并且任务的退化效应更新。机器维护持续的时间取决于维护活动的开始时间。假定任务的实际加工时间是关于任务排序位置及资源分配的凸函数,目标是确定任务的窗口、资源分配、任务排序使得提前惩罚、延误惩罚、窗口位置、窗口宽度、时间表长、任务完工时间之和惩罚及资源消耗费用之和最小。给出一个最优算法求解该问题。

This paper considered a single-machine due-window assignment scheduling problem based on a common flow allowance. In order to improve production efficiency, a budget of resource is assumed to be fi- nite. Once the maintenance activity has been completed, the machine will revert to its initial condition and the aging effect will start anew. The maintenance duration depends on its starting time. We assumed the actu- al processing time of a job was a convex function of its position and resource allocation. The objective was to find the common flow allowance, the due-window size, the resource allocation and the job sequence which minimizes the total cost of earliness, tardiness, the starting time of due-window, the size of due-window, makespan, the total of completion time of all jobs, and resource allocation. We introduce an efficient algorithm to solve the problem.