期刊文献+

柔性生产中人员配置模型及其调度算法 被引量:8

Operator allocation model and scheduling algorithm for flexible job-shop problem
下载PDF
导出
摘要 为减少柔性生产企业的劳务费用,提高运营效益,以合理的人工分配方案和最佳作业排序为目标建立了数学模型,并设计一种多目标混合算法.将作业分解为子作业层和父作业层,采用遗传算法和动态规划法获取最佳的人工分配方案.在人工优化模型的基础上利用模拟退火遗传算法,将搜索空间限制在第一工位工件投产序列的置换向量空间内,并采用交叉算子和变异算子对选择算子进行了重新设计,生成最优作业排序计划.一组测试问题的求解结果表明了所提出方法的有效性及鲁棒性. To reduce crew expenses and raise operation profits of flexible production enterprises,a mathematical model was constructed on the basis of reasonable operator allocation scheme and optimal sequence of operations,and a multi-objective mixed algorithm was used for solving the problem.The operation is divided into two layers,and the man-hour optimization scheme can be acquired by genetic algorithm and dynamic programming method.A simulated annealing genetic algorithm was proposed to optimize the sequence of operations,in which the search was limited to the space of permutation vectors of the order,and a given set of jobs were performed in the first stage using a hybrid crossover operators and mutation operators to redesign the selection operators.A set of test results show that the proposed algorithm is effective.
出处 《哈尔滨工业大学学报》 EI CAS CSCD 北大核心 2012年第5期144-148,共5页 Journal of Harbin Institute of Technology
关键词 柔性生产 遗传算法 动态规划 人员配置 作业排序 flexible job-shop genetic algorithm dynamic programming operator allocation sequence of operations
  • 相关文献

参考文献14

  • 1ERTAY T, RUAN D. Data envelopment analysis based decision model for optimal operator allocation in CMS [ J ]. European Journal of Operational Research, 2005, 164 (3): 800-810.
  • 2ISLAM R, RASAD S M. Employee performance evaluation by the AHP: A case study [ J]. Asia Pacific Management Review, 2006, 11 (3) : 163 - 176.
  • 3YANG T, CHEN M C, HUNG C C. Multiple attribute decision-making methods for the dynamic operator allocation problem [ J ]. Mathematics and Computers in Simulation, 2007, 73 (5):285- 299.
  • 4BRUCKER P, HEITMANN S, HURINK J. Flow-shop problems with intermediate buffers [ J ]. OR Spectrum, 2003, 25 (4): 549 - 574.
  • 5RONCONI D P. A note on constructive heuristics for the flow-shop problem with blocking [J]. International Journalof Production Economics, 2004, 87( 1 ) : 39 -48.
  • 6WANG Ling, ZHEN D Z. An effective hybrid heuristic for flow-shop scheduling [ J ]. International Journal of Advanced Manufacturing Technology, 2003, 21 (1) : 38 -44.
  • 7PONNAMBALAM S G, MOHAN R M. A GASA multiobjective hybrid search algorithm for integrating lot sizing and sequencing in flow-line scheduling [ J]. International Journal of Advanced Manufacturing Technology, 2003, 21 (6) :126 - 137.
  • 8SAWIK T. Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers [ J ]. Mathematical and Computer Modeling, 2000, 31 ( 13 ) : 39 - 52.
  • 9BHASHKAR K, SRINIVASAN G. Static and dynamic operator allocation problems in cellular manufacturing systems [ J ]. International Journal of Production Research, 1997, 35 (12): 3467-3481.
  • 10SUER G A, BERA I S. Optimal operator assignment and cell loading when lot-splitting is allowed [ J]. Com puters and Industrial Engineering, 1998, 35 (3) : 431 - 434.

二级参考文献27

  • 1曹振新,朱云龙.多目标遗传算法在混流装配线排序中的应用[J].计算机工程,2005,31(22):1-3. 被引量:12
  • 2[1]CHEN Hao-xun, IHLOW J, LEHMANN C. A genetic algorithm for flexible job-shop scheduling [A]. Proceedings of the 1999 IEEE International Conference on Robotics & Automation [C]. Detroit: IEEE, 1999:1120-1125.
  • 3[2]CHEN Jyh-horng, FU Li-chen, LIN Ming-hung, et al.Petri-net and GA-based approach to modeling, scheduling, and performance evaluation for wafer fabrication [J]. IEEE Transaction on Robotics and Automation,2001, 17(5): 619-636.
  • 4[3]LEE D Y, DICESARE F. Scheduling flexible manufacturing systems using Petri nets and heuristic search [J]. IEEE Transaction on Robotics and Automation,1994, 10(2): 123-132.
  • 5[4]DORIGO M, GAMBARDELLA L M. Ant colony system: A cooperative learning approach to the traveling salesman problem [J]. IEEE Transactions on Evolutionary Computation, 1997, 1 (1): 53- 66.
  • 6[5]MANIEZZO V, COLORNI A. The ant system applied to the quadratic assignment problem [J]. IEEE Transaction on Knowledge Data Engineering, 1999, 11 (5):769-778.
  • 7[6]WANG Xiao-rong, WU Tie-jun. Ant colony optimization for intelligent scheduling [A]. Proceedings of the 4th World Congress on Intelligent Control and Automation [C]. Shanghai:[s.n.], 2002:66-70.
  • 8BOYSEN N, FLIEDNER M, SCHOLL A. Sequencing mixed-model assembly lines: Survey, classification and model critique[J]. European Journal of Operational Research, 2009, 192: 349-373.
  • 9JIN Zhihong, YANG Zan, ITO T. Metaheuristic algorithms for the multistage hybrid flowshop scheduling problem[J]. International Journal of Production Economics, 2006, 100: 322-334.
  • 10WANG Xianpeng, TANG Lixin. A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers[J]. Computers and Operations Research, 2009, 36: 907-918.

共引文献28

同被引文献39

引证文献8

二级引证文献33

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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