期刊文献+

改进GSO算法的成套订单调度和维修联合优化

Joint Optimization of Whole-set Order Scheduling and Equipment Maintenance Based on Improved GSO Algorithm
下载PDF
导出
摘要 基于对生产调度和设备维修间相关关系的分析,设计了成套订单调度和设备维修的联合策略。该策略根据故障率的大小来判定对应的设备维修活动或后续的调度任务,根据该策略,以加工作业顺序和预防性维修阈值为决策变量,加权成套订单数最大为优化目标构建了联合决策模型。利用对调度问题特点和设备故障机理的分析,设计了一个改进的萤火虫算法,将其运用于求解所提出的联合决策模型,并通过数值实验和灵敏度分析,验证了改进算法的可行性和模型的有效性。 Through analyzing the relevance of production scheduling and equipment maintenance,a joint strategy of whole-set order scheduling and equipment maintenance is designed.In this strategy,the corresponding maintenance activities and subsequent scheduling tasks are determined by the failure rate.According to this strategy,a joint decision-making model is obtained.The decision variables of this model include the order of processing operations,preventive maintenance thresholds as decision variables,and maximizing the number of weighted whole-set orders is the optimization goal.Aided by the analysis of the characteristics of the scheduling problem and the mechanism of equipment failure,an improved Glowworm Swarm Optimization algorithm is designed and applied to solve the proposed joint decision-making model.Numerical experiments and sensitivity analysis verify the feasibility of the improved algorithm and the effectiveness of the model.
作者 杨晓梅 张宇琼 李文汇 官开 YANG Xiao-mei;ZHANG Yu-qiong;LI Wen-hui;GUAN Kai(Key Research Bases for Humanities and Social Sciences in Shanxi:Research Center for Innovation and Development of Equipment Manufacturing Industry,Taiyuan University of Science and Technology,Taiyuan 030024,China;School of Economics and Management,Taiyuan University of Science and Technology,Taiyuan 030024,China)
出处 《太原科技大学学报》 2023年第5期469-475,共7页 Journal of Taiyuan University of Science and Technology
基金 国家自然科学基金(71701140) 山西省自然科学基金(201801D121170,201801D121166) 太原科技大学博士启动资金项目(20202027)。
关键词 成套订单调度 预防性维修 萤火虫优化算法(GSO) whole-set order scheduling preventive maintenance GSO algorithm
  • 相关文献

参考文献5

二级参考文献23

  • 1周水银,傅青.最大化流水作业加权成套订单数的研究[J].控制工程,2007,14(2):212-214. 被引量:1
  • 2周水银,陈荣秋.单机加权成套订单数遗传算法研究[J].系统工程,2005,23(5):22-24. 被引量:16
  • 3吴春辉,周水银.并行多机加权成套订单数极大化的混合遗传算法[J].系统工程理论与实践,2006,26(11):125-129. 被引量:5
  • 4苏亚,傅青.并行机含调整时间成套订单数问题遗传算法[J].控制工程,2007,14(1):78-81. 被引量:2
  • 5Moor J M. An n-job,one machine sequencing algorithm for minimizing the number of late jobs[J]. Management Science, 1968,15:102~109.
  • 6Hino C M, Ronconi D P, Mendes A B. Minimizing earliness and tardiness penalties in a single-machine problem with a common due date[J]. European Journal of Operational Research,2005,160:190~201
  • 7Schaller J. Single machine scheduling with early and quadratic tardy penalties[J]. Computers & Industrial Engineering, 2004,46:511~532.
  • 8Ng C T D, Cheng T C E, Kovalyov M Y. Single machine batch scheduling with jointly compressible setup and processing times [J]. European Journal of Operational Research, 2004,153:211~219.
  • 9Agnetis A,Alfieri A,Nicosia G. A heuristic approach to batching and scheduling a single machine to minimize setup costs [J]. Computers & Industrial Engineering, 2004,46:793~802.
  • 10Lawler E L,Moore J M. A functional equation and its application to resource allocation and sequencing problems [J]. Management Sci., 1969,16:77~84.

共引文献22

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部