摘要
研究带凸资源和恶化效应的单机窗口指派排序问题,其中窗口指的是松弛窗口,凸资源和恶化效应指的是工件的实际加工时间是其开始加工时间的线性函数,是其资源消耗量的凸函数。目标是确定工件的加工顺序,资源分配量以及窗口的开始加工时间和长度使其在总资源消耗费用(与窗口有关的排序费用)有上界限制的条件下,极小化与窗口有关的排序费用(总资源消耗费用)。获得了求解上述问题的最优算法,证明了该问题是多项式时间可解的。
In this paper we consider the single machine due window assignment scheduling problem with convex resource and deterioration effect,in which due window is a slack due window,and convex resource and deterioration effect mean that the actual processing time of a job is a linear function of its starting time and a convex function of resource consumption.The objective is to find the optimal schedule,the resource allocation of jobs and the starting time of slack due window and its size of due window,so as to minimize the schedule cost associated with the slack due window(the total resource consumption cost)when the total resource consumption cost(the schedule cost associated with the slack due window)is a given upper bound.The optimal algorithms are proposed,and we prove that this problem can be solved in polynomial time.
作者
姜昆
JINAG Kun(Department of Natural Sciences, Shantou Polytechnic, Shantou 515078, China)
出处
《运筹与管理》
CSSCI
CSCD
北大核心
2020年第7期105-109,共5页
Operations Research and Management Science
基金
汕头职业技术学院校级项目(SZK2020Y03)。
关键词
排序
松弛窗口
恶化效应
凸资源
scheduling
slack due window
deterioration effect
convex resource
