期刊文献+

A Novel Particle Swarm Optimization for Flow Shop Scheduling with Fuzzy Processing Time 被引量:1

A Novel Particle Swarm Optimization for Flow Shop Scheduling with Fuzzy Processing Time
下载PDF
导出
摘要 Since in most practical cases the processing time of scheduling is not deterministic, flow shop scheduling model with fuzzy processing time is established. It is assumed that the processing times of jobs on the machines are described by triangular fuzzy sets. In order to find a sequence that minimizes the mean makespan and the spread of the makespan, Lee and Li fuzzy ranking method is adopted and modified to solve the problem. Particle swarm optimization (PSO) is a population-based stochastic approximation algorithm that has been applied to a wide range of problems, but there is little reported in respect of application to scheduling problems because of its unsuitability for them. In the paper, PSO is redefined and modified by introducing genetic operations such as crossover and mutation to update the particles, which is called GPSO and successfully employed to solve the formulated problem. A series of benchmarks with fuzzy processing time are used to verify GPSO. Extensive experiments show the feasibility and effectiveness of the proposed method. Since in most practical cases the processing time of scheduling is not deterministic, flow shop scheduling model with fuzzy processing time is established. It is assumed that the processing times of jobs on the machines are described by triangular fuzzy sets. In order to find a sequence that minimizes the mean makespan and the spread of the makespan, Lee and Li fuzzy ranking method is adopted and modified to solve the problem. Particle swarm optimization (PSO) is a population-based stochastic approximation algorithm that has been applied to a wide range of problems, but there is little reported in respect of application to scheduling problems because of its unsuitability for them. In the paper, PSO is redefined and modified by introducing genetic operations such as crossover and mutation to update the particles, which is called GPSO and successfully employed to solve the formulated problem. A series of benchmarks with fuzzy processing time are used to verify GPSO. Extensive experiments show the feasibility and effectiveness of the proposed method.
作者 牛群 顾幸生
出处 《Journal of Donghua University(English Edition)》 EI CAS 2008年第2期115-122,共8页 东华大学学报(英文版)
基金 The National Natural Science Foundation of China ( No.60774078) Innovation Foundation of Shanghai University ,Scientific Research Special Fund of Shanghai Excellent Young Teachers , Chenguang Project ( No.2008CG48) Shanghai Leading Academic Discipline Project ( No.T0103)
关键词 flow shop SCHEDULING FUZZY PSO 旅行商问题 数学规划 粒子群最优化 模糊处理时间
  • 相关文献

参考文献10

  • 1Ozelkan E C,,Duckstein L.Opti mal Fuzzy Counterparts of Project Scheduling Rules [ J ][].European Journal of Operational Research.1999
  • 2Ar mentano V A,Ronconi D P.Tabu Search for Total Tardiness Mini mization in Flow Shopscheduling Problems[].Computers and Operations Research.1999
  • 3Eberhart R C,Kennedy J.A New Opti mizer Using Particle Swar m Theory[].Proceedings of the Sixth InternationalSymposiumon Micro Machine and Human Science Micro Machine and Human Science.1995
  • 4Laskari E C,Parsopoulos K E,Vrahatis M N.Particle Swar m Opti mization for Mini max Problems [ C ][].Proceedings of the IEEECongress on Evolutionary Computation.2002
  • 5Mostaghi mS,Teich J.Strategies for Finding Good Local Guides in Multi-objective Particle Swar m Opti mization [ C][].Proceedings ofIEEE Swar m Intelligence Symposium.2003
  • 6Clerc M.New Opti mization Techniques in Engineering [ M][]..2004
  • 7Liu B,Wang L,Jin Y H.An Effective Hybrid Particle Swar m Opti mization for No-wait Flow Shop Scheduling [J ][].International Journal of Advanced Manufacturing Technology.2007
  • 8Yager R R.A Procedure for Ordering Fuzzy Subsets of the Setting of Possibility Theory[].Infor mation Sciences.1981
  • 9Lee E S,Li RJ.Comparison of Fuzzy Numbers Based on the Probability Measure of Fuzzy Events[].Computers and Mathematics With Applications.1988
  • 10Omar A,Ghrayeb A.Bi-criteria Opti mization: Mini mizing the Integral Value and Spread of the Fuzzy Makespan of Job Shop Scheduling Problems [ J ][].Applied Soft Computing.2003

同被引文献12

  • 1徐震浩,顾幸生.不确定条件下的中间存储时间有限的Flow Shop提前/拖期调度问题[J].控制理论与应用,2006,23(3):480-486. 被引量:8
  • 2欧微,邹逢兴,高政.基于混合粒子群算法的柔性Flow-shop调度方法研究[C]//第28届中国控制与决策会议,2008:946-951.
  • 3GOVIL M,PROTH J M.Supply chain design and management:strategic and tactical perspetives[M].London:Academic Press,2002.
  • 4PROTH J M.Scheduling:new trends in industry environment[J].Annual Reviews in Control,2007,31(1):157-166.
  • 5CHAUVET F,LEVNER E,MEYZIN L K,et al.On-line scheduling in a surface treatment system[J].European Journal of Operatio-nal Research,2000,120(2):382-392.
  • 6李明切 顾幸生.处理时间不确定情况下Job Shop问题鲁棒调度研究.浙江大学学报:自然科学版,1998,32:711-719.
  • 7KENNEDY J,EBERHART R.Particle swarm optimization[C] //Proc of IEEE International Conference on Neural Networks.1995:1942-1948.
  • 8ABIDO M A.Optimal power flow using particle swarm optimization[J].Electrical Power and Energy Systems,2002,24(7):563-571.
  • 9BERGH van den F,ENGELBECHT A P.Cooperative learning in neural networks using particle swarm optimizers[J].South African Computer Journal,2000,26(11):84-90.
  • 10SALMAN A,AHMAD I,AL-MADANI S.Particle swarm optimization for task assignment problem[J].Microprocessors and Mic-rosystems,2002,26(8):363-371.

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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