Journal of Shanghai Jiaotong University ›› 2015, Vol. 49 ›› Issue (08): 1191-1198.

• Automation Technique, Computer Technology • Previous Articles     Next Articles

A MultiObjective Integrated Optimization Method for FJSP Based on Multi-Rule Resource Allocation

GAO Li1a,2,ZHOU Binghai2,YANG Xueliang1b,Wang Jixia1a   

  1. (1. a. Library; b. Research Institute of Industrial Engineering, School of Management, University of Shanghai for Science and Technology, Shanghai 200093, China; 2. Research Institute of Industrial Engineering, School of Mechanical Engineering, Tongji University, Shanghai 201804, China)
  • Received:2014-09-19 Online:2015-08-31 Published:2015-08-31

Abstract:

Abstract: In order to reduce the complexity of multi-objective optimization in flexible jobshop scheduling and improve optimization efficiency, a multiobjective integrated optimization method with multiple resource constraints was proposed in this paper. Firstly, an integrated optimization model was established according to the objectives of minimum completion time, optimal human resource allocation plan, maximum equipment load and lowest production costs. Besides, in  view of the explosive characteristics of combination model,  an integrated scheduling rule for multiple resources allocation was presented to reduce the model complexity. As for the selection strategies of the scheduling rules, the rules with a high probability were preferentially selected through adjusting the probability of rules. In addition, the multiplerule guiding mechanism was adopted to push the search process toward the target direction. Furthermore,  the improved nondominated sorting genetic algorithm (NSGAⅡ) was adopted to obtain the Pareto solution sets of different probability values of the rules. Finally, the effectiveness of the proposed method was verified by simulation comparison.

Key words:  , flexible job-shop scheduling; multi-objective integrated optimization; multirule; multiple resources; non-dominated sorting genetic algorithm

CLC Number: