• 其他栏目

    林林

    • 教授     博士生导师 硕士生导师
    • 主要任职:软件学院、大连理工大学-立命馆大学国际信息与软件学院副院长
    • 性别:男
    • 毕业院校:日本早稻田大学
    • 学位:博士
    • 所在单位:软件学院、国际信息与软件学院
    • 学科:软件工程
    • 办公地点:开发区校区 信息楼305
    • 电子邮箱:

    访问量:

    开通时间:..

    最后更新时间:..

    论文成果

    当前位置: 中文主页 >> 科学研究 >> 论文成果
    Multiobjective evolutionary algorithm for manufacturing scheduling problems: state-of-the-art survey

    点击次数:

      发布时间:2019-03-09

      论文类型:期刊论文

      发表时间:2014-10-01

      发表刊物:JOURNAL OF INTELLIGENT MANUFACTURING

      收录刊物:EI、SCIE

      卷号:25

      期号:5,SI

      页面范围:849-866

      ISSN号:0956-5515

      关键字:Manufacturing scheduling; Multiobjective evolutionary algorithm ( MOEA); Hybrid evolutionary; algorithm (HEA); Job shop scheduling (JSP); Flexible JSP (FJSP); Advanced planning and scheduling (APS); Automatic guided vehicle (AGV)

      摘要:Scheduling is an important tool for a manufacturing system, where it can have a major impact on the productivity of a production process. In order to find an optimal solution to scheduling problems it gives rise to complex combinatorial optimization problems. Unfortunately, most of them fall into the class of NP-hard combinatorial problems. In this paper, we focus on the design of multiobjective evolutionary algorithms (MOEAs) to solve a variety of scheduling problems. Firstly, we introduce fitness assignment mechanism and performance measures for solving multiple objective optimization problems, and introduce evolutionary representations and hybrid evolutionary operations especially for the scheduling problems. Then we apply these EAs to the different types of scheduling problems, included job shop scheduling problem (JSP), flexible JSP, Automatic Guided Vehicle (AGV) dispatching in flexible manufacturing system (FMS), and integrated process planning and scheduling (IPPS). Through a variety of numerical experiments, we demonstrate the effectiveness of these Hybrid EAs (HEAs) in the widely applications of manufacturing scheduling problems. This paper also summarizes a classification of scheduling problems, and illustrates the design way of EAs for the different types of scheduling problems. It is useful to guide how to design an effective EA for the practical manufacturing scheduling problems. As known, these practical scheduling problems are very complex, and almost is a combination of different typical scheduling problems.