期刊文献+

最小资源浪费的并行混流装配线调度研究

On Parallel Mixed-model Assembly Scheduling with Minimum Wastage of Resources
下载PDF
导出
摘要 带有资源约束的并行混流装配线目前很少有人研究。本文研究了一类在给定计划期内,带有资源约束的,最小资源浪费的并行混流装配线调度模型,它属于NP-hard问题。建立了整数规划模型,该模型创新之处是:将平衡与排序建立在同一个目标函数里。为提高求解速度,对基本的遗传算法进行了改进,提出了改进的种群构造方法,引进了禁忌算法。最后给出了实例验证,说明其有效性。 Study on parallel mixed-model assembly with paper, a kind of parallel mixed-model assembly schedule studied to get the minimum wastage of resources. It is resource constraints is few in the open literature. In this with resource constraints during a certain plan period was an NP-hard problem. An integer programming model is built. The innovation of the model is that the balance and scheduling were built in the same objective function. To enhance the calculating speed, the basic genetic algorithm is improved, and taboo search algorithm is introduced. Finally, we give an example to show its effectiveness.
出处 《机械科学与技术》 CSCD 北大核心 2008年第12期1545-1547,共3页 Mechanical Science and Technology for Aerospace Engineering
基金 国防科技重点实验室基金项目(51458100205BQ0203)资助
关键词 遗传算法 禁忌搜索算法 最小资源浪费 并行混流装配线 genetic algorithm taboo search algorithm minimum wastage of resources parallel mixed-model assembly
  • 相关文献

参考文献6

  • 1Leonardi S, Raz D. Approximating total flow time on parallel machines[J]. Journal of Computer and System Sciences, 2007, 73(6) :875 -891
  • 2Jenabi M, Fatemi Ghomi S M T, Torabi S A, Karimi B. Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines[J]. Applied Mathematics and Computation, 2007,186( 1 ) :230 -245
  • 3Meyr H. Simultaneous lotsiting and scheduling on parallel machines [ J ]. European Journal of Operational Research, 2002,139(2) :277 -292
  • 4Sundararaghavan P S, Kunnathur A S, Viswanathan I. Minimizing makespan in parallel flow shop[J]. Journal of the Operational Research Society, 1997,48 ( 8 ) :834-842
  • 5庞哈利,万珊珊.并行流程式生产线调度问题的概率分析求解算法[J].东北大学学报(自然科学版),2003,24(4):338-341. 被引量:4
  • 6Balakrishnan J, Cheng C H, Wong K F. Facopt: a user friendly facility layout optimization system[J]. Computers & Operalions Research, 2003,30( 11 ) :1625-21641

二级参考文献10

  • 1Doframaci A, Surkis J. Evaluation of a heuristic for scheduling independent jobs on parallel identical processors[J]. Management Science, 1979,25:1208-1216.
  • 2Li C, Cheng T. The parallel machine minmax weigthed absolute lateness scheduling problem[J]. Naval Research Logistics, 1993,41:33-46.
  • 3Garey M, Johnson. The complexity of flow shop and jobshop scheduling[J]. Mach O R, 1976,(1):117-129.
  • 4Widmer M, Hertz A. A new heuristic method for the flow shop sequencing problem[J]. Eur J Opl Res, 1989,41:183-193.
  • 5Sundararaghavan P, Kunnathur A, Viswanathan I. Minimizing makespan in parallel flow shop[J]. Opns Res Soc, 1997,48:834-842.
  • 6Baluja S. Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning[R]. Technical Report CMU-CS-95-163, School of Computer Science, Carnegie Mellon University, Pittsburgh, 1994.
  • 7Sukthankar R, Baluja S, Hancock J. Mutiple adaptive agents for tactical driving[J]. Applied Intelligence, 1998,(9):7-23.
  • 8Salustowicz R, Schmidhuber J. Probabilistic incremental program evolution[J]. Evolutionary Computation, 1997,5(2):123-141.
  • 9衣扬,汪定伟.并行多机成组工件调度的启发式算法[J].东北大学学报(自然科学版),2001,22(1):9-16. 被引量:3
  • 10金炳尧,蔚承建,何振亚.一个用于优化搜索的学习算法[J].软件学报,2001,12(3):448-453. 被引量:20

共引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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