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

作　　者：侯福均 吴祈宗 

机构地区：[1]School of Management and Economics, Beijing Institute of Technology

出　　处：《Journal of Beijing Institute of Technology》2007年第2期231-236,共6页北京理工大学学报（英文版）

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

摘　　要：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.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.

关 键 词：parallel machine scheduling programming model possibility measure credibility measure fuzzy number genetic algorithm 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] N945.15[自动化与计算机技术—控制科学与工程]