期刊文献+

基于客户满意度的模糊神经网络JSP研究 被引量:1

Study on Fuzzy Neural Network JSP Based on Customer Satisfaction
原文传递
导出
摘要 针对具有不确定性因素的作业车间调度问题,基于模糊数学的思想,把模糊加工时间、间隔期和模糊交货期用梯形模糊数表示,建立了基于客户满意度的模糊作业车间调度模型。运用Hopfield神经网络算法求解,结合目标函数和JSP的全部约束条件,构建能量函数和JSP换位矩阵,保证了神经网络稳态输出为最优生产调度方案。最后用网络计划图对稳态输出的换位矩阵进行解码得到最优调度甘特图,避免了传统成本树法易出现死锁调度的问题。计算实例验证了本算法的可行性和有效性。 For the job-shop scheduling with the uncertain factors, and according to the fuzzy theory, Fuzzy processing tinge,interval and fuzzy due date were denoted by trapezoid fuzzy number. A fuzzy job shop scheduling model was built up based on clients' degree of satisfaction. Hopfield neural network algorithm was used to solve the problem. With the objective function and constraints of JSP,energy function and JSP commutants were given, in order to ensure that steady-state output of neural network was the best scheduling options. At last, the network plan graph was used to decode steady-slate output matrix transpesition as optimal scheduling Gantt chart. In this process, Deadlock scheduling problems were avoided ,which often appeared in traditional cost tree method. The calculating example shows that the algorithm is feasible and effective.
作者 刘辉 陈友玲
出处 《世界科技研究与发展》 CSCD 2011年第5期809-813,共5页 World Sci-Tech R&D
基金 重庆市自然科学基金计划项目(CSTC 2009BB3362) 重庆市教委科学技术研究项目(KJ08A06) 重庆大学第三期"211工程"创新人才培训项目(S-09107)资助项目
关键词 模糊作业车间调度 客户满意度 HOPFIELD神经网络 网络计划图 fuzzy job shop scheduling clients' degree of satisfaction Hopfied neural network network plan graph
  • 相关文献

参考文献11

  • 1ZADEH L A. Fuzzy sets [ J ]. Inform and Control, 1965, ( 8 ) : 338- 353. 被引量:1
  • 2王书锋,梁燕,冯冬青,王策.基于遗传算法的模糊Job-Shop问题的研究[J].机械设计与制造,2009(11):44-46. 被引量:5
  • 3耿兆强,邹益仁.基于遗传算法的作业车间模糊调度问题的研究[J].计算机集成制造系统-CIMS,2002,8(8):616-620. 被引量:32
  • 4FOO S Y P,TAKEFUJI Y. Stochastic neural networks for solving jobshop scheduling : Parts I. Problem representation [ C ]. In : Proceeding of the IEEE International Conference on Neural Networks : vol. II, San Diego, CA. 1988:275-282. 被引量:1
  • 5FOO S Y P,TAKEFUJI Y. Stochastic neural networks for solving jobshop scheduling: Parts II. Architecture and simulations [ C ], In: Proceeding of the [EEE International Conference on Neural Networks: vol.II,San Diego,CA, 1988:283-290. 被引量:1
  • 6FOO S Y P, TAKEFU.II Y. Integer-linear programming neural networks for job-shop scheduling [ C ], Proc. IEEE IJCNN , San Diego, CA. 1988:341-348. 被引量:1
  • 7刘普寅,吴孟达编著..模糊理论及其应用[M].长沙:国防科技大学出版社,1998:413.
  • 8TRAN L, DUCKSTEIN L. Comparison of fuzzy numbers using a fuzzy distance measure[J]. Fuzzy Set and System,2002, (130):331-341. 被引量:1
  • 9王万良,吴启迪著..生产调度智能算法及其应用[M].北京:科学出版社,2007:331.
  • 10王凌,郑大钟.TSP及其基于Hopfield网络优化的研究[J].控制与决策,1999,14(6):669-674. 被引量:27

二级参考文献5

共引文献60

同被引文献17

  • 1陈知美,顾幸生.基于蚁群算法的不确定条件下的Job Shop调度[J].山东大学学报(工学版),2005,35(4):74-79. 被引量:8
  • 2熊禾根,李建军,孔建益,杨金堂,蒋国璋.考虑工序相关性的动态Job shop调度问题启发式算法[J].机械工程学报,2006,42(8):50-55. 被引量:33
  • 3Wannapom Teekeng,Arit Thammano.Modified Genetic Algorithm for Flexible Job-Shop Scheduling Problems[J].Procedia Computer Science,2012(12): 122-128. 被引量:1
  • 4Rajendran Chandrasekharan, Ziegler Hans. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan / total flowtime of jobs[J].European Journal of Operational Research, 2004,155(2):426-438. 被引量:1
  • 5Koulinas Georgios,Lazaros Kotsikas,Konstantinos Anagnostopoulos. A particle swarm optimization based hyper- heuristic algorithm for the classic resource constrained project scheduling problem[J].Information Sciences,2014,277:680-693. 被引量:1
  • 6David A. Ress,Kenneth R.Currie. Development of an expert system for scheduling work content in a job shop environment [J]. Computers & Industrial Engineering, 1993,25( 1-4): 131-134. 被引量:1
  • 7Haibin Yu,Wei Liang.Neural network and genetic algorithm-based hybrid approach to expanded job-shop scheduling[J].Computers & Industrial Engineering,2001,39(3-4):337-356. 被引量:1
  • 8Holthaus Oliver,Rajendran Chandrasekharan.Efficient dispatching rules for scheduling in a job shop[J].Int.J.Production Economics,1997,48:87-105. 被引量:1
  • 9Holthaus O.Design of efficient job shop scheduling rules[J]. Computers ind. Engng,1997,33(l-2):249-252. 被引量:1
  • 10Rajendran Chandrasekharan , Holthaus Oliver.A comparative study of dispatching rules in dynamic flowshops and jobshops[J]. European Journal of Operational Research, 1999,116:156-170. 被引量:1

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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