工件可拒绝与机器具有退化维护活动的无关机排序问题  

Unrelated parallel-machine scheduling with job rejection and deteriorating maintenance activities

作　　者：高洁 隋玉康 邹娟[1] 孙安宁 GAO Jie;SUI Yukang;ZOU Juan;SUN Anning(School of Mathematical Sciences,Qufu Normal University,273165,Qufu,Shandong,PRC)

机构地区：[1]曲阜师范大学数学科学学院,山东省曲阜市273165

出　　处：《曲阜师范大学学报（自然科学版）》2022年第4期1-6,F0002,共7页Journal of Qufu Normal University(Natural Science)

基　　金：国家自然科学基金(11801310);山东省大学生创新创业训练计划项目(S202010446062)。

摘　　要：研究了机器具有退化维护活动和工件可拒绝的无关机排序问题,目标是寻求退化维护活动的位置、接受工件的排序以及每台机器上接受工件的公共交货期,使得所有接受工件的总提前和延误惩罚与所有拒绝工件的总拒绝成本之和达到最小.设计了该问题的多项式时间算法.A scheduling problem with job rejection and deteriorating maintenance activities on an unrelated parallel-machine setting is studied.The aim is to determine the position of the deteriorating maintenance activity,the job sequence of the accepted jobs,and the common due date of the accepted jobs on each machine so as to minimize total earliness and tardiness cost of the accepted jobs plus total penalty of the rejected jobs.It is shown that the problem can be optimally solved in polynomial time.

关 键 词：排序 无关机 退化维护活动 提前和延误 公共交货期 

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