Parallel Machine Scheduling Models with Fuzzy Parameters and Precedence Constraints: A Credibility Approach

作     者：侯福均 吴祈宗 

作者机构：School of Management and Economics Beijing Institute of Technology 

出 版 物：《Journal of Beijing Institute of Technology》 (北京理工大学学报（英文版）)

年 卷 期：2007年第16卷第2期

页      面：231-236页

核心收录：

学科分类：12[管理学] 0711[理学-系统科学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 081104[工学-模式识别与智能系统] 08[工学] 0835[工学-软件工程] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 071102[理学-系统分析与集成] 

基　　金：Sponsored by the Basic Research Foundation of Beijing Institute of Technology (BIT-UBF-200508G4212) 

主　　题：parallel machine scheduling programming model possibility measure credibility measure fuzzy number genetic algorithm 

摘      要：A method for modeling the parallel machine scheduling problems with fuzzy parameters and precedence constraints based on credibility measure is provided. For the given n jobs to be processed on m machines, it is assumed that the processing times and the due dates are nonnegative fuzzy numbers and all the weights are positive, crisp numbers. Based on credibility measure, three parallel machine scheduling problems and a goal-programming model are formulated. Feasible schedules are evaluated not only by their objective values but also by the credibility degree of satisfaction with their precedence constraints. The genetic algorithm is utilized to find the best solutions in a short period of time. An illustrative numerical example is also given. Simulation results show that the proposed models are effective, which can deal with the parallel machine scheduling problems with fuzzy parameters and precedence constraints based on credibility measure.