期刊文献+

考虑机器非加工状态的作业车间节能调度 被引量:2

Jop-shop Energy Saving Scheduling under Machine Non-working Condition
下载PDF
导出
摘要 为了减少机器在非加工状态时的能耗,采用机器关闭再开启的决策方案来实现此目的.首先建立目标为总能耗和最大完工时间最小化的车间节能调度模型,并将此决策方案抽象为约束条件,然后提出一种基于混合元胞遗传模拟退火算法的求解方法,引入插入式贪婪解码算法进行解码,基于同步机制的遗传操作更新种群,增加模拟退火操作与收敛准则实现进一步优化.最后通过案例验证了该模型与算法的有效性与实用性,结果表明运用该模型可达到很好的节能优化效果. To reduce energy consumption under machine non-working condition, the decision method of ma- chine is closed and then opened to achieve this goal. First, a multiobjective jop-shop optimization model based on this decision method is put forward, in which the energy consumption and makespan are considered. Then, a cellular genetic algorithm-simulating annealing algorithm (CGA-SA) is designed, with using insert greedy decoding algorithm, updating population by genetic operation based on synchronization, increasing simulated annealing and convergence criterion to improve searching performance. Finally, the effectiveness and practica- bility of model and algorithm are verified by case study. The results show that the model can achieve a good energy saving effect.
作者 吴正佳 华露 白炜铖 涂晶鑫 刘秀凤 徐峥 Wu Zhengjia Hua Lu Bai Weicheng Tu Jingxin Liu Xiufeng Xu Zheng(College of Mechanical & Power Engineering, China Three Gorges Univ. , Yichang 443002, Chin)
出处 《三峡大学学报(自然科学版)》 CAS 2017年第5期100-105,共6页 Journal of China Three Gorges University:Natural Sciences
基金 湖北省自然科学基金资助项目(2014CFB686)
关键词 节能 多目标 作业车间调度 混合元胞遗传模拟退火算法 energy saving multiobjective jop-shop scheduling cellular genetic algorithm-simulated an- nealing algorithm
  • 相关文献

参考文献3

二级参考文献35

  • 1张超勇,饶运清,刘向军,李培根.基于POX交叉的遗传算法求解Job-Shop调度问题[J].中国机械工程,2004,15(23):2149-2153. 被引量:115
  • 2滕素珍,冯敬海.数理统计学[M].大连:大连理工大学出版社,2005.
  • 3Nabil. Nasr, E A Elsayed. Job shop scheduling with alternative machines[ J ]. International Journal Production Research, 1990, 28(9) : 1595-1609.
  • 4Nowicki E, Smutnicki C. A fast taboo search algorithm for the job shop problem [ J ]. Management Science, 1996,42 ( 6 ) :797-813.
  • 5BAKER K R, SCUDDER G D. Sequencing with earliness and tardiness penalties:a review[J]. Operations Research,1990,38 (1) : 22-36.
  • 6BECK J C, REFALO P. Combining local search and linear programming to solve earliness/tardiness scheduling problems [C]//Proceedings of the 4th International Workshop on Inte- gration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems. Le Croisic, France: CP-AI-OR'02,2002: 221-235.
  • 7BECK J C, REFALO P. A hybrid approach to scheduling with earliness and tardiness costs [J]. Annals of Operations Research,2003,118(1/2/3/4):49-71.
  • 8DANNA E, PERRON I.. Structured vs. unstructured large neighborhood search: a case study on job-shop scheduling problems with earliness and tardiness eosts[J]. Lecture Notes in Computer Science, 2003,2833 : 817-821.
  • 9DANNA E, ROTHBERG E, PAPE C L. Integrating mixed integer programming and local search: a case study on job-shop scheduling problems[C]//DOI.. 10. 1.1. 111. 5253. pdf.
  • 10BAPTISTEA P, FLAMINI M, SOURD F. Lagrangian boun- ds for just-in-time Job-Shop scheduling[J]. Computers& Operations Research, 2008,35 (3) : 906-915.

共引文献37

同被引文献12

引证文献2

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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