计算机科学 ›› 2015, Vol. 42 ›› Issue (9): 220-225.doi: 10.11896/j.issn.1002-137X.2015.09.042

• 人工智能 • 上一篇    下一篇

混合多目标算法用于柔性作业车间调度问题

左益,公茂果,曾久琳,焦李成   

  1. 西安电子科技大学智能感知与图像理解教育部重点实验室智能 感知与计算国际联合研究中心 西安710071,西安电子科技大学智能感知与图像理解教育部重点实验室智能 感知与计算国际联合研究中心 西安710071,西安电子科技大学智能感知与图像理解教育部重点实验室智能 感知与计算国际联合研究中心 西安710071,西安电子科技大学智能感知与图像理解教育部重点实验室智能 感知与计算国际联合研究中心 西安710071
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受国家自然科学基金(61273317)资助

Hybrid Multi-objective Algorithm for Solving Flexible Job Shop Scheduling Problem

ZUO Yi, GONG Mao-guo, ZENG Jiu-lin and JIAO Li-cheng   

  • Online:2018-11-14 Published:2018-11-14

摘要: 在生产调度领域,柔性作业车间调度问题是一个非常重要的优化问题。大多数研究通常优化的目标只是最大完工时间,而在实际中,往往要考虑多个目标。因此,提出了一种新的混合多目标算法用于解决柔性作业车间调度问题,其中考虑了3个目标,分别是:最大完工时间、机器总负载和瓶颈机器负荷。算法设计了有效的编码方式和遗传算子,并采用非支配近邻免疫算法求解非支配最优解。为了提高算法性能,提出了3种不同的局部搜索策略,并将其结合在多目标算法中。在多个数据集上的实验对比结果表明,所提算法优于其它代表性的算法。此外,实验结果还验证了局部搜索技术的有效性。

关键词: 柔性作业车间调度问题,多目标,局部搜索,非支配近邻免疫算法

Abstract: The flexible job shop scheduling problem is one of the most important optimization problems in the field of production scheduling,due to its complexity and practical applications in real life.Most studies focus on only one objective—the makespan that is the total time required to complete all jobs.However,a single objective may be insufficient for real applications.Therefore,a new hybrid multi-objective algorithm was proposed for solving the flexible job shop scheduling problem(FJSP) with three objectives,including the makespan,total workload,and critical workload.Effective chromosome representation and genetic operators are introduced.The nondominated neighbor immune algorithm is used to search for Pareto optimal solutions.To improve the search performance,three different local search strategies were designed and combined in the multi-objective algorithm.The computational results on several data sets show that the proposed algorithm outperforms other representative algorithms in general.In addition,the experiments validate the effectiveness of local search strategies.

Key words: Flexible job shop scheduling problem,Multi-objective,Local search,Nondominated neighbor immune algorithm

[1] 刘莹,谷文祥,李向涛.置换流水线车间调度问题的研究[J].计算机科学,2013,40(11):1-7 Liu Y,Gu W X,Li X T.Research on permutation flow-shop scheduling problem [J].Computer Science,2013,40(11):1-7
[2] Garey M R,Johnson D S,Sethi R.The complexity of flowshop and job-shop scheduling [J].Mathematics of Operations Research,1976,3(1):117-129
[3] Brandimarte P.Routing and scheduling in a flexible job shop by tabu search [J].Annals of Operations Research,1993,1(3):157-183
[4] Hurink E,Jurisch B,Thole M.Tabu search for the job shopscheduling problem with multi-purpose machine [J].Operations Research Spectrum,1994,15(4):205-215
[5] Mastrolilli M,Gambardella L M.Effective neighborhood func-tions for the flexible job shop problem [J].Journal of Scheduling,2000,3(1):3-20
[6] Gao J,Sun L,Gen M.A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems [J].Computers & Operation Research,2008,35(9):2892-2907
[7] Pezzella F,Morganti G,Ciaschetti G.A genetic algorithm for theflexible job-shop scheduling problem [J].Computers & Operation Research,2008,35(10):3202-3212
[8] Hmida B A,Haouari M,Huguet M J,et al.Discrepancy search for the flexible job shop scheduling problem [J].Computers & Operation Research,2010,37(12):2192-2201
[9] Yuan Y,Xu H,Yang J.A hybrid harmony search algorithm for the flexible job shop scheduling problem [J].Applied Soft Computing,2013,13(7):3259-3272
[10] Yuan Y,Xu H.Multiobjective Flexible Job Shop Scheduling Using Memetic Algorithms [J].IEEE Transactions on Automation Science and Engineering,2013,12(1):336-353
[11] Xia W,Wu Z.An effective hybrid optimization approach formulti-objective flexible job-shop scheduling problems [J].Computers & Industrial Engineering,2005,48(2):409-425
[12] Zhang G,Shao X,Li P,et al.An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem [J].Computers & Industrial Engineering,2009,56(4):1309-1318
[13] Xing L,Chen Y,Yang K.An efficient search method for multi-objective flexible job shop scheduling problems [J].Journal of Intelligent Manufacturing,2009,20(3):283-293
[14] Kacem I,Hammadi S,Borne P.Pareto-optimality approach for flexible job-shop scheduling problems [J].Hybridization of evolutionary algorithms and fuzzy logic Mathematics and Compu-ters in Simulation,2002,60(3):245-276
[15] Wang X,Gao L,Zhang C,et al.A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem [J].The International Journal of Advanced Manufacturing Technology,2010,51(5):757-767
[16] Li J,Pan Q,Xie S.An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems [J].Applied Mathematics and Computation,2012,218(18):9353-9371
[17] Chiang T,Lin H.Flexible job shop scheduling using a multiobjective memetic algorithm [M]∥ Advanced Intelligent Computing Theories and Applications.With Aspects of Artificial Intelligence.Springer Berlin Heidelberg.2012:49-56
[18] Chiang T,Lin H.A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling [J].International Journal of Production Economics,2013,141(1):87-98
[19] Gong M G,Jiao L C,Du H,et al.Multi-objective immune algorithm with nondominated neighbor-based selection [J].Evolutionary Computation,2008,16(2):225-255
[20] Cheng R.A tutorial survey of job-shop scheduling problems using genetic algorithms,part I:Representation [J].Computers & Industrial Engineering,1996,30(4):983-997
[21] Balas E.Machine scheduling via disjunctive graphs:an implicit enumeration algorithm [J].Operations Research,1969,17(6):941-957
[22] Zitzler E,Thiele E,Laumanns M,et al.Performance assessment of multiobjective optimizers:An analysis and review [J].IEEE Transactions on Evolutionary Computation,2003,7(2):117-132

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!