首页 | 本学科首页   官方微博 | 高级检索  
     检索      

不确定条件下不同交货期窗口的Job Shop 调度
引用本文:李,平,顾幸生.不确定条件下不同交货期窗口的Job Shop 调度[J].管理科学,2004,7(2):22-26.
作者姓名:    顾幸生
作者单位:华东理工大学自动化研究所,上海,200237
基金项目:国家自然科学基金资助项目(60274043);国家高技术研究发展计划资助项目(2002AA412610).
摘    要:研究了具有不同交货期窗口的Job Shop 的提前/ 拖期调度问题,并考虑了处理时间的不确定 性,采用三角模糊数表示处理时间的不确定性,提出了基于遗传算法的求解算法. 仿真实验验证了 算法的有效性.

关 键 词:Job  Shop  生产调度    不确定性    提前/  拖期    不同交货期窗口    遗传算法
文章编号:1007-9807(2004)02-0022-05
修稿时间:2002年11月25

Job Shop scheduling with uncertain processing time and distinct due windows
Abstract:The Job Shop scheduling problem with distinct due windows is discussed. Uncertain processing time is also considered , which is denoted by triangular fuzzy number , and two fuzzy operators are introduced also. Fuzzy programming model is established for the scheduling problem. Based on the algorithmof maximizing the membership function of middle value , the fuzzy programming model is transformed into deterministic programming model and an effective genetic algorithm is presented also. A great deal of simulation results are given to illustrate the efficiency of the proposed model and the scheduling algorithm.
Keywords:Job Shop scheduling  uncertainty  earliness/ tardiness  distinct due window  genetic algorithm
本文献已被 万方数据 等数据库收录!
点击此处可从《管理科学》浏览原始摘要信息
点击此处可从《管理科学》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号