用遗传算法解模糊交货期下Flow Shop调度问题  

Flow Shop Scheduling with Fuzzy Due Dates Using Genetic Algorithm

作　　者：吴悦[1] 汪定伟[1] 

机构地区：[1]东北大学信息科学与工程学院系统工程系,辽宁沈阳110006

出　　处：《系统工程理论与实践》2000年第2期108-112,共5页Systems Engineering-Theory & Practice

基　　金：国家 8 6 3CIMS基金!( 86 3 5 1 1 96 0 1 6 0 3);国家自然科学基金!( 6 96 84 0 0 5 )

摘　　要：运用模糊的观点研究了flowshop调度问题,基于模糊交货期的概念建立了两种不同的模糊flowshop调度问题的模型,模糊交货期的隶属函数对应于完成时间的满意度,目标函数定义为所有任务加权的隶属函数之和问题是确定任务的加工顺序极大化目标函数文章运用遗传算法(GA)确定了任务的调度。This paper discusses flow shop scheduling from the viewpoint of fuzziness. We formulate a fuzzy flow shop scheduling problem based on the concept of fuzzy due dates. The membership function of the fuzzy due date corresponds to the grade of satisfaction of a completion time. The objective function is the sum of the weighted membership function over given jobs. Our problem is to find the sequence that maximizes the objective function. We find the scheduling by using genetic algorithm. An example is employed to illustrate the effectiveness of the algorithm.

关 键 词：准时制 模糊交货期 调度问题 遗传算法 

分 类 号：O224[理学—运筹学与控制论] O242.23[理学—数学]