带有准备时间和退化维护的单机排序问题  

Single-Machine Scheduling Problem with Setup Time and Deteriorating Maintenance

作　　者：王亚男 罗成新[1] WANG Yanan;LUO Chengxin(School of Mathematics and System Science,Shenyang Normal University,Shenyang,Liaoning 110034,China)

机构地区：[1]沈阳师范大学数学与系统科学学院,辽宁沈阳110034

出　　处：《平顶山学院学报》2018年第5期10-16,39,共8页Journal of Pingdingshan University

基　　金：国家自然科学基金(11171050);辽宁省教育厅科学研究一般项目(L2014433)

摘　　要：研究带有可变加工时间、准备时间和退化维护的公共交货期与凸资源分配的单机排序问题.工件的实际加工时间是关于所分配的不可再生资源量和与工件位置有关的退化效应的函数,并且在每个工件加工之前都有一个准备时间,它是有关资源分配的凸函数.为了消除机器的退化,在规划时间内最多允许执行一次维护活动.在资源总量有限的条件下,确定最优工件排序、最优公共交货期、最优维护位置和最优资源分配方案,使得由工件的提前惩罚、延误惩罚、公共交货期和最大完工时间构成的总费用最小.根据优化的相关知识,将问题转化为匹配问题,给出了该问题的启发式算法.This paper studies a single machine scheduling and common due - date assignment and convex resource allocation problem with variable job processing time and deteriorating maintenance. The actual processing time of a job is a function of the non - renewable resource amount allocated and position - dependent deteriora- tion effect. Before each job is processed, its setup time is required, it is a convex function of resource allocation. In order to counteract the deterioration effect on the machine, at most one maintenance is allowed throughout the planning time. The objective is to determin the optimal job schedule, optimal common due - date, optimal ma- intenance position and optimal resource allocation to minimize the total costs of earliness and tardiness of the jobs, common due- date and the makespan under the condition that the total resource amount is limited. Ac- cording to the related knowledge of optimization, we present a heuristic algorithm to solve the problem by trans- forming it into a matching problem.

关 键 词：排序 准备时间 退化维护 公共交货期 资源分配 

分 类 号：O223[理学—运筹学与控制论]