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

不确定条件下不同交货期窗口的Flow Shop调度
引用本文:李平,顾幸生.不确定条件下不同交货期窗口的Flow Shop调度[J].系统仿真学报,2004,16(1):155-158.
作者姓名:李平  顾幸生
作者单位:华东理工大学自动化研究所,上海,200237
基金项目:国家自然科学基金项目(60274043),国家高技术研究发展计划项目(2002 AA412610)
摘    要:研究了具有不同交货期窗口的Flow Shop的提前/拖期调度问题,并考虑了处理时间的不确定性。采用三角模糊数表示不确定性信息,引入两种模糊运算,建立了问题的模糊规划模型,并采用“中间值最大隶属度”的算法将模糊规划模型转化为清晰的非线性规划模型。针对清晰的数学模型提出了基于遗传算法的优化方法,最小化对所有工件提前/拖期惩罚。最后,大量仿真实验验证了算法的有效性。

关 键 词:Flow  Shop生产调度  不确定性  提前/拖期  不同交货期窗口  遗传算法
文章编号:1004-731X(2004)01-0155-03
修稿时间:2002年6月20日

Flow Shop Scheduling Problem with Uncertain Processing Time and Distinct Due Window
LI Ping,GU Xing-sheng.Flow Shop Scheduling Problem with Uncertain Processing Time and Distinct Due Window[J].Journal of System Simulation,2004,16(1):155-158.
Authors:LI Ping  GU Xing-sheng
Abstract:The Flow Shop scheduling problem with distinct due window is discussed in this paper. Uncertain processing time is also considered, which has been denoted by triangular fuzzy number, and two fuzzy operators are introduced. Fuzzy programming model has been established, which is then transformed into deterministic nonlinear programming model by using the algorithm of maximizing the membership function of middle value, and an effective genetic algorithm has presented to minimize the earliness/tardiness punish for all the jobs. The simulation results have shown the efficiency of the proposed algorithm.
Keywords:Flow Shop scheduling  uncertainty  earliness/tardiness  distinct due window  genetic algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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