基于广义粗糙集的不确定条件下的Flow Shop调度  

Flow Shop Scheduling Problem under Uncertainty Based on Generalized Rough Sets

作　　者：于艾清[1] 顾幸生[1] 

机构地区：[1]华东理工大学自动化研究所,上海200237

出　　处：《系统仿真学报》2006年第12期3369-3372,3376,共5页Journal of System Simulation

基　　金：国家自然科学基金项目(60274043);上海市科委重大科技攻关项目(04dz11008)

摘　　要：在实际生产调度过程中,加工时间的不确定性是普遍存在的,因此引用广义粗糙变量来表示不确定的工件处理时间,定义粗糙加法运算,precision以及ratio,建立了处理时间不确定性的FlowShop调度问题的粗糙规划模型,提出了粗糙遗传调度算法将其应用于调度模型的求解,仿真实验证明了算法的有效性。In reality, processing time is often imprecise and this imprecision is critical for the scheduling problem, therefore the generalized rough sets was employed to represent uncertain processing time. The rough scheduling programming model of Flow Shop scheduling problem with uncertain processing time was set up based on the new definitions of rough addition operator, precision and ratio. Finally, rough scheduling GA was adopted to minimize the makespan and it is proved to be efficient by the simulation results.

关 键 词：FLOW Shop调度 不确定 广义粗糙集 遗传算法 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]