带有机器维修和多个工期的单机排序问题  

Multiple Common Due-date Assignment and Optimal Maintenance Scheduling with Linear Deteriorating Jobs

作　　者：李韦萱 赵传立[1] 

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

出　　处：《重庆师范大学学报（自然科学版）》2015年第1期22-27,共6页Journal of Chongqing Normal University:Natural Science

摘　　要：针对具有恶化工件和机器维修的单机排序模型,讨论了多个工期的指派问题。在这一模型中,机器在加工过程中产生恶化使效率降低,工件的实际加工时间是关于开始加工时间的线性递增函数;机器的维修区间是关于开始维修时间的线性递增函数,维修工作完成后,机器将恢复到初始状态,工件的恶化也重新开始。目标是确定最优排序、最优工期和最优维修位置以便极小化工件的提前、延误和工期的总费用。对于这一问题,给出了最优解的一些相关性质,证明了这个问题是多项式时间可解的。Aiming at the single machine scheduling model with simple linear deterioration and machine maintenance activity, we discuss multiple due-date assignment problems. In this model, the machine deteriorates during the processing procedure making the efficiency of processing jobs lower and the actual processing time of jobs depend on the starting times. The length of the maintenance time is a linear function of its starting time. Once completing the maintenance, the machine restores the processing efficiency and the deterioration of jobs start again. The objective is to schedule the jobs, the due-date and the maintenance activity, so as to minimize the total cost including earliness, tardiness, and the due-date starting times and sizes. We provide some properties of optimal sequence and turn to solve the matching problem at last show that it remains polynomial time solvable.

关 键 词：单机 排序 线性恶化 多个工期 维修活动 

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