ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

A memetic algorithm for multi-objective flexible job-shop problem with worker flexibility

Gong, Xuran; Deng, Qianwang*; Gong, Guiliang; Liu, Wei; Ren, Qinghuahunan univ
International Journal of Production Research2018DOI: 10.1080/00207543.2017.1388933
69被引4阅读
引用收藏
分享

摘要

In existing scheduling models, the flexible job-shop scheduling problem mainly considers machine flexibility. However, human factor is also an important element existing in real production that is often neglected theoretically. In this paper, we originally probe into a multi-objective flexible job-shop scheduling problem with worker flexibility (MO-FJSPW). A non-linear integer programming model is presented for the problem. Correspondingly, a memetic algorithm (MA) is designed to solve the proposed MO-FJSPW whose objective is to minimise the maximum completion time, the maximum workload of machines and the total workload of all machines. A well-designed chromosome encoding/decoding method is proposed and the adaptive genetic operators are selected by experimental studies. An elimination process is executed to eliminate the repeated individuals in population. Moreover, a local search is incorporated into the non-dominated sorting genetic algorithm II. In experimental phase, the crossover operator and elimination operator in MA are examined firstly. Afterwards, some extensive comparisons are carried out between MA and some other multi-objective algorithms. The simulation results show that the MA performs better for the proposed MO-FJSPW than other algorithms.

学科与关键词

关键词
flexible job shop schedulingmulti-objective optimisationhuman factorsmemetic algorithmNSGA-II
相关
加载中…
  • Memetic algorithm based on learning and decomposition for multiobjective flexible job shop scheduling considering human factors
    Lou, Hangyu; Wang, Xianpeng*; Dong, Zhiming; Yang, Yang*Swarm and Evolutionary Computation, 2022, 75: 101204.被引 17
  • A distributed flexible job shop scheduling problem considering worker arrangement using an improved memetic algorithm
    Luo, Qiang; Deng, Qianwang*; Gong, Guiliang; Guo, Xin; Liu, XiahuiEXPERT SYSTEMS WITH APPLICATIONS, 2022, 207: 117984.被引 40
  • Memetic algorithm based on non-dominated levels for flexible job shop scheduling problem with learn-forgetting effect and worker cooperation
    Han, Kaixing; Gong, Wenyin*COMPUTERS & INDUSTRIAL ENGINEERING, 2025, 200: 110845.
查看全部 →

发表信息

论文状态
公开发表
期刊
International Journal of Production Research
发表日期
2018
卷期
第 56 卷, 第 7 期
页码
2506-2522
DOI
10.1080/00207543.2017.1388933
语言
MULTI-LANGUAGE
期刊等级
Q1
成果收录
SCIE
资助标注
National Natural Science Foundation of China [71473077]; National Key Technology R&D Program of China [2015BAF01B00]

作者

  • G

    Gong, Xuran (第一作者)

    hunan univ

  • D

    Deng, Qianwang (通讯)

    hunan univ

查看全部 5 位作者收起作者
  • G

    Gong, Guiliang

    hunan univ

  • L

    Liu, Wei

    hunan univ

  • R

    Ren, Qinghua

    hunan univ

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417