期刊文献+

基于混合启发式的多设备类型跨单元调度方法 被引量:3

Hybrid heuristic approach for inter-cell scheduling with various machine types
在线阅读 下载PDF
导出
摘要 Inter-cell scheduling is analyzed where there are various machine types and exceptional jobs that need to visit machines in multiple job shop cells in a cellular manufacturing system(CMS).A hybrid heuristic approach combining hyper-heuristic and ant colony optimization is developed.Different structures are designed for different types of machines under the framework of ACO.The pheromone trails are updated integratedly after the whole solution is constructed to achieve cooperative optimization.Experimental results show that the hybrid heuristic approach has significant advantages over ACO and CPLEX with respect to the makespan and utilization rate of the batch processing machine,and our approach is especially suitable for large dimension problems. The issue of inter-cell scheduling is analyzed in the context of various machine types, with respect to the exceptional jobs that need to visit machines in multiple job shop cells in a cellular manufacturing system (CMS). A hybrid heuristic approach combining hyper-heuristic and ant colony optimization is developed. Dif- ferent structures are designed for diffenrent types of machines under the framework of ACO. The pheromone trails are updated integratedly after the whole solution is constructed, therefore achieving cooperative opti- mization. Experimental results show the hybrid heuristic has significant advantages comparing with ACO and CPLEX with respect to makespan and utilization rate of the batch processing machine, and is especially suitable for large dimension problems.
出处 《系统工程学报》 CSCD 北大核心 2013年第5期709-716,共8页 Journal of Systems Engineering
基金 北京市自然科学基金资助项目(4122069)
关键词 批处理机 单元制造系统 跨单元调度 超启发式算法 蚁群优化算法 batch processing machine cellular manufacturing system inter-cell scheduling hyper-heuristic algorithm ant colony optimization
  • 相关文献

参考文献1

二级参考文献13

  • 1Yang W H, Liao C J. Group scheduling on two cells with intercell movement. Computers and Operations Research, 1996, 23(10): 997--1006.
  • 2Garza O, Smunt T L. Countering the negative impact of in- tercell flow in cellular manufacturing. Journal of Operations Management, 1991, 10(1): 92-118.
  • 3Solimanpur M, Vrat P, Shankar R. A heuristic to minimize makespan of cell scheduling problem. International Journal of Production Economics, 2004, 88(3): 231-241.
  • 4Gholipour-Kanani Y, Tavakkoli-Moghaddam R, Khorrami A. Solving a multi-criteria group scheduling problem for a cellular manufacturing system by scatter search. Journal of the Chinese Institute of Industrial Engineers, 2011, 28(3): 192--205.
  • 5Tang J F, Wang X Q, Kaku I, Yung K L. Optimization of parts scheduling in multiple cells considering intercell move using scatter search approach. Journal of Intelligent Manu- facturing, 2010, 21(4): 525-537.
  • 6Elmi A, Solimanpur M, Topaloglu S, Elmi A. A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant parts. Computers and Industrial Engineering, 2011, 61(1): 171-178.
  • 7Lin G Y J, Solberg J J. Effectiveness of flexible routing con- trol. International Journal of Flexible Manufacturing Sys- tems, 1991, 3(3-4): 189-211.
  • 8Rajabinasab A, Mansour S. Dynamic flexible job shop scheduling with alternative process plans: an agent-based approach. The International Journal of Advanced Manufac- turing Technology, 2011, 54(9-12): 1091-1107.
  • 9张长胜,孙吉贵,杨轻云,郑黎辉.一种求解车间调度的混合算法[J].自动化学报,2009,35(3):332-336. 被引量:13
  • 10刘民.基于数据的生产过程调度方法研究综述[J].自动化学报,2009,35(6):785-806. 被引量:41

共引文献7

同被引文献42

  • 1潘燕春,周泓,冯允成,魏佳呈.同顺序Flow-shop问题的一种遗传强化学习算法[J].系统工程理论与实践,2007,27(9):115-122. 被引量:4
  • 2Zhang Y, Li X P. A quantum-inspired iterated greedy algorithm for permutation flowshops in a collaborative manufacturing environment[J]. International Journal of Computer Integrated Manufacturing, 2012, 25(10): 924-933.
  • 3Aytug H, Lawley M A, Mckay K, et al. Executing production schedules in the face of uncertainties: A review and some future directions[J]. European Journal of Operational Research, 2005, 161(1): 86-110.
  • 4Weng W, Wei X, Fujimura S. Dynamic routing strategies for JIT production in hybrid flow shops[J]. Computers & Operations Research, 2012, 39(12): 3316-3324.
  • 5Wang K, Choi S H. A decomposition-based approach to flexible flow shop scheduling under machine breakdown[J]. International Journal of Production Research, 2012, 50(1): 215-234.
  • 6Katragjini K, Vallada E, Ruiz R. Flow shop rescheduling under different types of disruption[J]. International Journal of Production Research, 2013, 51(3): 780-797.
  • 7Liu Q, Ullah S, Zhang C Y. An improved genetic algorithm for robust permutation flowshop scheduling[J]. The International Journal of Advanced Manufacturing Technology, 2011, 56(1): 345-354.
  • 8Rahmani D, Heydari M. Robust and stable flow shop scheduling with unexpected arrivals of new jobs and uncertain processing times[J]. Journal of Manufacturing Systems, 2014, 33(1): 84-92.
  • 9Gino F, Pisano G. Toward a theory of behavioral operations[J]. Manufacturing & Service Operations Management, 2008, 10(4): 676-691.
  • 10De S C, Van W W, Jorna R J. An empirical investigation of scheduling performance criteria[J]. Journal of Operations Management, 2011, 29(3): 181-193.

引证文献3

二级引证文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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