Multi-objective Genetic Algorithm for Solving Multi-objective Flow-shop Inverse Scheduling Problems

  • MOU Jianhui ,
  • GUO Qianjian ,
  • GAO Liang ,
  • ZHANG Wei ,
  • MOU Jiancai ,
  • ZHANG Jian-Hui ,
  • YAN Kang ,
  • ZHANG Fan ,
  • ZHOU Ying-Zi ,
  • GONG Xiao-Jing
Expand
  • 1. School of Mechanical Engineering, Shandong University of Technology, Zibo 255000;
    2. State Key Lab of Digital Manufacturing Equipment and Technology, Huazhong University of Science & Technology, Wuhan 430074;
    3. Guangzhou Huali Science and Technology Vocational College, Guangzhou 511325

Online published: 2016-11-15

Abstract

A new method of scheduling fields (Inverse scheduling problem,ISP) is discussed under the theories and methods of inverse optimization. The definition of an inverse scheduling problem is that the exact values of parameters (e.g. processing times,due dates) are controllable and a feasible job sequence is given but not optimal and pre-specified job sequence(s) become optimal through adjusting processing parameters for a target. The model of multi-objective ISP which considers scheduling efficiency and system stability is build. The adjustment of processing parameters,the changing of system and the weighted completion time are considered in this model. A hybrid multi-objective genetic algorithm is proposed to solve this problem. In order to improve the performance of algorithm,the multiple strategies are mixed,including rapid non-dominated sorting method,two kinds of diversity strategy,hybrid elitism strategy and efficient local search strategy. Finally,public problem instances and ANOVA analysis are provided for the proposed algorithm. The results demonstrate the effectiveness of the algorithm.

Cite this article

MOU Jianhui , GUO Qianjian , GAO Liang , ZHANG Wei , MOU Jiancai , ZHANG Jian-Hui , YAN Kang , ZHANG Fan , ZHOU Ying-Zi , GONG Xiao-Jing . Multi-objective Genetic Algorithm for Solving Multi-objective Flow-shop Inverse Scheduling Problems[J]. Journal of Mechanical Engineering, 2016 , 52(22) : 186 -197 . DOI: 10.3901/JME.2016.22.186

Outlines

/

〈 〉