期刊文献+

并行流程式生产线调度问题的概率分析求解算法 被引量:4

Applying Probability Learning Based Evolutionary Algorithm to Parallel Flow Lines Scheduling Problem
下载PDF
导出
摘要 并行生产线调度问题兼有并行机器和流程车间调度问题的特点 ,是一类新型的调度问题·针对工件在各工序具有任意加工时间的一般并行生产线调度问题 ,构造了整数规划模型 。 Parallel flow-lines scheduling is a new kind of scheduling. The parallel scheduling has the characters of the parallel machines and the flow shop scheduling. A general parallel flow lines problem with the objective of minimizing makespan was considered, and a mixed integer programming model is given. In view of the intractable nature of the problem, a probability learning based evolutionary algorithm was proposed to solve the problem. The algorithm was tested on some randomly generated problems.
出处 《东北大学学报(自然科学版)》 EI CAS CSCD 北大核心 2003年第4期338-341,共4页 Journal of Northeastern University(Natural Science)
基金 辽宁省博士启动基金资助项目 (2 0 0 112 0 2 0 )
关键词 并行生产线调度 最大完工时间 概率分析算法 parallel flow lines scheduling probability learning evolutionary algorithm
  • 相关文献

参考文献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.
  • 5衣扬,汪定伟.并行多机成组工件调度的启发式算法[J].东北大学学报(自然科学版),2001,22(1):9-16. 被引量:3
  • 6Sundararaghavan P, Kunnathur A, Viswanathan I. Minimizing makespan in parallel flow shop[J]. Opns Res Soc, 1997,48:834-842.
  • 7Baluja 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.
  • 8Sukthankar R, Baluja S, Hancock J. Mutiple adaptive agents for tactical driving[J]. Applied Intelligence, 1998,(9):7-23.
  • 9Salustowicz R, Schmidhuber J. Probabilistic incremental program evolution[J]. Evolutionary Computation, 1997,5(2):123-141.
  • 10金炳尧,蔚承建,何振亚.一个用于优化搜索的学习算法[J].软件学报,2001,12(3):448-453. 被引量:20

二级参考文献6

共引文献21

同被引文献25

  • 1郭永辉,钱省三.晶圆复杂制造系统在线优化调度系统研究[J].半导体技术,2007,32(4):284-287. 被引量:2
  • 2Leonardi S, Raz D. Approximating total flow time on parallel machines[J]. Journal of Computer and System Sciences, 2007, 73(6) :875 -891
  • 3Jenabi 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
  • 4Meyr H. Simultaneous lotsiting and scheduling on parallel machines [ J ]. European Journal of Operational Research, 2002,139(2) :277 -292
  • 5Sundararaghavan 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
  • 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
  • 7KIM J H.Stable schedule for a single-armed duster tool with time constraints[C]//Procceeddings of the 4th IEEE Conference on Automation Science and Engineering.Washington,D.C.,USA:IEEE,2008:97-102.
  • 8ROSTAMI S,HAMIDZADEH B.An optimal residency-aware scheduling technique for duster tools with buffer module[J].IEEE Transactions on Semiconductor Manufacturing,2004,17(1):68-73.
  • 9LEE T E,PARK S H.An extended event graph with negative places and tokens for timed window constraints[J].IEEE Transactions on Automation Science and Engineering,2005,2(4):319-332.
  • 10WU Naiqi,CHU Chengbin,CHU Feng,et al.A Petri net method for schedulability and scheduling problems in single-arm duster tools with wafer residency time constraints[J].IEEE Transactions on Semiconductor Manufacturing,2008,21(2):224-237.

引证文献4

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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