摘要
讨论具有截断控制参数学习效应和退化效应且工件的加工时间依赖于资源分配的单机排序问题。在凸资源消费函数条件下研究问题,每个任务有一个松弛工期窗口,任务的实际加工时间依赖于截断控制参数、工件的开始加工时间。分别考虑了在工件的提前惩罚、延误惩罚等费用受限的前提下,最小化资源费用;资源消耗总费受限的前提下,使带有提前、延误、交货期开始时间、交货期大小、最大完工时间及总完工时间加权和最小的单机排序问题。将问题转化为指派问题,证明了该问题是在多项式时间内可解的,并分别给出了两个多项式时间的最优算法,并给出了一个算例。
We study a single machine scheduling problem w ith truncated job-dependent learning effect and deterioration effects and processing time dependent on resource. The actual processing time of a job is a convex function of the resource amount allocated to it. Each job has a slack due-w indow. The actual processing time of each job depends on a truncated control parameter,the starting time and the resource amount allocated to it. Tw o single scheduling problems are studied. The first is to minimize total cost of early and tardy job,the start time,size of each due-w indow,makespan and total completion time,assume that total resource is limited by a given constant. The second is to minimize the total resource cost under the condition that a total objective value is limited by a given constant. We show that the problem is polynomial solvable by transforming this it into an assignment problem. Tw o polynomial time optimal algorithms are presented. An example is given to show the algorithm.
出处
《沈阳航空航天大学学报》
2017年第5期86-91,共6页
Journal of Shenyang Aerospace University
基金
辽宁省教育厅项目(项目编号:L2014433)
关键词
排序
资源分配
截断控制参数
退化效应
指派问题
scheduling
resource allocation
truncated control parameter
deterioration effect
assignment problem
