期刊文献+

管道工具喷粉线生产调度建模与算法

Research on modeling and algorithms for the scheduling problem of pipe tools powder painting production
原文传递
导出
摘要 针对不同品种、不同材质和不同颜色管道工具喷粉生产调度问题,以生产成本最小化为优化目标,研究其优化调度方法.首先,建立这个问题的混合整数非线性规划模型(MINLP);其次,针对该问题设计出相应的贪婪随机自适应搜索算法(GRASP)和遗传算法(GA);在此基础上,提出两种算法相集成的GRASP+GA算法.应用生产实例数据分析比较了这三种算法,验证了GRASP+GA算法的优越性. In this paper, the pipeline tool powder painting scheduling problem with different products, different materials and different colors, is studied to minimize the production cost. First, a mixed integer nonlinear programming model (MINLP) is constructed for this problem. Then two algorithms of the greedy randomized adaptive search procedure (GRASP) and genetic algorithm(GA) are designed. Furthermore, an integrative algorithm GRASP+GA is constructed for this problem. With the real production data the three algorithms are tested and the calculation results demonstrate that the GRASP+GA algorithm is much better than GRASP or GA.
出处 《系统工程理论与实践》 EI CSSCI CSCD 北大核心 2011年第12期2348-2354,共7页 Systems Engineering-Theory & Practice
基金 国家自然科学基金(70832005 71090404 71072026)
关键词 喷粉线 生产调度 贪婪随机自适应搜索算法(GRASP) 遗传算法(GA) GRASP+GA算法 powder painting line production schedule greedy randomized adaptive search procedure (GRASP) genetic algorithm (GA) GRASP+GA algorithm
  • 相关文献

参考文献9

  • 1Tang L X, Wang X P. A predictive reactive scheduling method for color-coating production in steel industry[J].International Journal of Advanced Manufacturing Technology, 2008, 35:633-645.
  • 2Tang L X, Wang X P, Liu J Y. Color-coating production scheduling for coils in inventory in steel industry[J].IEEE Transaction on Automation Science and Engineering, 2008(5): 544-549.
  • 3Tang L X, Wang X P. Simultaneously scheduling multiple turns for steel color-coating production[J]. European Journal of Operational Research, 2009, 198:715-725.
  • 4Tan K C, Narasimhan R, Rubin P A, et al. A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times[J]. The International Journal of Management Science 2000. 28: 313-325.
  • 5Gupta S R, Smith J S. An algorithms for single machine total tardiness scheduling with sequence dependent setups[J]. European Journal of Operational Research, 2006, 175:722-739.
  • 6Rubin P A, Ragatz G L. Scheduling in a sequence dependent setup environment with genetic search[J]. Conlputers and Operations Research, 1995, 22:85-99.
  • 7Resende M G, Ribeiro C C. Handbook of Meta-heuristics, International Series in Operations Research and Management Science[M]. NewYork: Kluwer Academic Publishers, 2003:219 249.
  • 8Mladenovic N, Hansen P. Variable neighborhood search[J]. Computers and Operations Research, 1997, 24: 1097- 1100.
  • 9Du J, Leung J Y T. Minimizing total tardiness on one machine is NP-hard[J]. Mathematics of Operations Research, 1990, 15:483-495.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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