在工件恶化及维修区间限制下带有潜在扰动的平行机问题  

Paralle-machine scheduling of deteriorating jobs with maintenance and potential machine disruptions

作　　者：叶拥军 YE Yongjun(College of Mathematics Sciences,Chongqing Normal University,Chongqing 401331,China)

机构地区：[1]重庆师范大学数学科学学院,重庆401331

出　　处：《周口师范学院学报》2018年第5期18-21,共4页Journal of Zhoukou Normal University

摘　　要：主要研究了带有潜在扰动及维修的平行机相关问题.在此环境中,机器在某一特殊时刻会发生扰动,工件的加工时间会随着工件的开始时间的增大而增大,即工件恶化;工件的加工状况为不可恢复,机器维修的时间不固定,而每台机器最多只维修一次.其目标函数为带有期望的总完工时间,提供了拟多项式时间算法来寻求最优排序规则,使带有期望的总完工时间最小并计算出时间复杂度.This paper studies paralle machine scheduling of potential machine disruptions and maintenance. In this envi ronment, the machine will become unavaliablc due to machine disruptions at a particular moment, the processing time will increase with the start time of the job, if the job is disrupted or maintenance during processing by a disrupted machine and it does need to rcstar after the machine becomes available again, it is called the non resumable, machine maintenance time is not fixed, and each machine maintenance only once. The objective function is minimum the total completion time with the expected, provide a pseudo polynomial time algorithm and the time complexity.

关 键 词：排序 机器中断 机器维修 总完工时间 

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