最小化完工时间和为第一目标的多目标不相容分批排序  

Multi-Criteria Batch Scheduling with Incompatible Job Families and the Total Completion Time as the Primary Criterion

作　　者：刘丽丽[1] LIU Lili(School of Mathematics,Physics and Statistics,Shanghai Polytechnic University,Shanghai 201209,China)

机构地区：[1]上海第二工业大学数理与统计学院,上海201209

出　　处：《上海第二工业大学学报》2023年第1期61-65,共5页Journal of Shanghai Polytechnic University

摘　　要：研究以工件总完工时间为第1目标的多目标不相容分批排序问题,对于加权总完工时间和最大延误为第2目标的排序问题给出了多项式时间的算法。对于误工工件个数和工件总延误为第2目标的排序问题的不同情况进行了讨论,给出了多项式时间算法或证明了其复杂性。The bicriterion scheduling with incompatible job families and the total completion time as the primary criterion is discussed.Polynomial time algorithms are developed for the problems with the total weighted completion time and the maximum tardiness as the secondary criterion.For the different cases of the problems with the number of tardy jobs and the total tardiness as the secondary criterion,polynomial time algorithms or complexity proofs are presented,respectively.

关 键 词：不相容工件 分批排序 多目标排序 

分 类 号：O29[理学—应用数学]