考虑维护且原材料易变质的单机调度问题  

Single Machine Scheduling Problem with Maintenance and Easy Deterioration of Raw Materials

作　　者：石梅 石帅 汪晴 Shi Mei;Shi Shuai;Wang Qing(Huaibei Normal University,Huaibei,Anhui 235000;China 2.West Anhui University,Lu'an,Anhui,237012,China)

机构地区：[1]淮北师范大学,安徽淮北235000 [2]皖西学院,安徽六安237012

出　　处：《黑龙江工业学院学报（综合版）》2020年第7期82-87,共6页Journal of Heilongjiang University of Technology(Comprehensive Edition)

基　　金：安徽省高校自然科学研究一般项目“工业大数据背景下基于协同熵函数的供应商网络协同效率研究”(项目编号:KJ2019B04);安徽省高校自然科学研究重点项目“基于张量的教育大数据统一表示和增量降维方法研究”(项目编号:KJ2019A0959)。

摘　　要：本文研究了满足两种约束的单机调度问题,第一种约束是机器在调度期内需要进行预防性维护,第二种约束是作业在调度期内所使用的原材料会发生变质,调度目标是所有作业的总变质成本最小化。基于维护时段与原材料变质的位置特性,分析了最优解性质,并提出了启发式算法H1和改进的模拟退火算法,应用插入与交换相结合方式提高传统模拟退火算法收敛速度。最后通过仿真实验对两种算法性能进行评估,结果验证了算法的有效性。This paper deals with a single machine scheduling problem with the aim to minimize the total deteriorating cost of jobs subjects to two constraints.The first constraint is that the machine will be stopped for maintenance after a interval and the second one is the raw materials is perishable.Combining maintenance time with positional characteristics of raw materials deterioration,and by analyzing the properties of the optimal solution,two algorithms are provided.The traditional simulated annealing algorithm has a slower convergence speed and the improved simulated annealing is approved.Finally,computational experiments are done to evaluate the performance of the algorithmsand the results verify the effectiveness of the algorithm.

关 键 词：机器维护 变质 启发式算法 单机 

分 类 号：TP301[自动化与计算机技术—计算机系统结构] F224[自动化与计算机技术—计算机科学与技术]