单机加工问题在一般条件下的算法研究  

Algorithm Research of Single Machine Machining Problem under General Conditions

作　　者：王文禹 段怡丹 陈正潇 张沐瑶 WANG Wenyu;DUAN Yidan;CHEN Zhengxiao;ZHANG Muyao(College of Science,Northeastern University,Shenyang,Liaoning 110136;College of Information Science and Engineering,Northeastern University,Shenyang,Liaoning 110136)

机构地区：[1]东北大学理学院,辽宁沈阳110136 [2]东北大学信息科学与工程学院,辽宁沈阳110136

出　　处：《科教导刊》2020年第3期49-50,共2页The Guide Of Science & Education

摘　　要：Biskup首次将学习效应的约束条件引入排序模型,此后带有学习效应的相关排序问题受到了众多学者的关注.大量学者研究了特定条件下带有学习效应的单机排序问题,并给出了多项式算法的证明.对于更为一般条件下的此类问题,通常使用分枝定界法和启发式算法进行求解和对比验证.本文重点介绍分枝定界算法在带有学习效应的单机排序中的应用和几种常用的启发式算法,并给出了一些后续的研究方向.Since Biskup firstly introduced the constraints of learning effects into the scheduling model,the related scheduling problems with learning effects has attracted the attention of many scholars.A large number of scholars have studied the singlemachine scheduling problem with learning effects under certain conditions,and the proof of the polynomial algorithm is given.For the scheduling problem under more general conditions,the branch and bound method and the heuristic algorithm are usually used to solve the problem and verify by comparison.This paper focuses on the application of branch and bound algorithm in the single machine scheduling problem with learning effect,summarizes several commonly used heuristic algorithms,and gives some follow-up research directions.

关 键 词：排序问题 学习效应 分枝定界算法 启发式算法 

分 类 号：O211.6[理学—概率论与数理统计]