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

An iterated greedy algorithm integrating job insertion strategy for distributed job shop scheduling problems

Huang, Lin; Tang, Dunbing*; Zhang, Zequn; Zhu, Haihua; Cai, Qixiang; Zhao, Shikui南京航空航天大学
JOURNAL OF MANUFACTURING SYSTEMS2024-12DOI: 10.1016/j.jmsy.2024.10.014
1阅读
引用收藏
分享

摘要

The distributed scheduling problem (DSP) becomes particularly important with the popularization of the distributed manufacturing mode. The distributed job shop scheduling problem (DJSP) is a typical representative of the DSP. It consists of two subproblems, assigning jobs to factories and determining the operation sequence on machines. Some benchmark instances have been proposed to test the performance of the DJSP approach, but most instances have not found the optimal solution. In this paper, an iterated greedy algorithm integrating job insertion (IGJI) is proposed to solve the DJSP. Firstly, a job insertion strategy based on idle time (JIIT) is designed for the insertion of a job into a factory. Secondly, JIIT is used in the reconstruction phase of IGJI, while three destruction-reconstruction methods are designed to balance the makespan among factories. Finally, tabu search is adopted in the local search phase of IGJI to improve the solution quality further. The performance of IGJI is tested on 240 benchmark instances, and the experimental results show that the solution quality of IGJI outperforms the other four state-of-the-art algorithms. In particular, IGJI has found 231 new solutions for these benchmark instances.

学科与关键词

关键词
Distributed job shop schedulingJob insertion strategyIterated greedy algorithmTabu searchMakespan
相关
加载中…
  • An effective iterated greedy method for the distributed permutation fl owshop scheduling problem with sequence-dependent setup times
    Huang, Jiang-Ping; Pan, Quan-Ke*; Gao, LiangSwarm and Evolutionary Computation, 2020, 59: 100742.被引 96
  • An iterated greedy algorithm with acceleration of job allocation probability for distributed heterogeneous permutation flowshop scheduling problem
    Li, Haoran; Li, Xinyu; Gao, Liang*Swarm and Evolutionary Computation, 2024, 88: 101580.被引 1
  • Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem
    Shao, Weishi; Shao, Zhongshi*; Pi, DechangKnowledge-Based Systems, 2020, 194: 105527.被引 120
查看全部 →

发表信息

论文状态
公开发表
期刊
JOURNAL OF MANUFACTURING SYSTEMS
发表日期
2024-12
卷期
第 77 卷
页码
746-763
DOI
10.1016/j.jmsy.2024.10.014
语言
ENGLISH
成果收录
SCIE
资助标注
National Natural Science Foundation of China [92267109, 52075257, 52305539, 52275490]; Natural Science Foundation of Jiangsu Province [BK20230880]; China Postdoctoral Science Foundation [2023M731661]; Aeronautical Science Foundation of China [2023Z074052007]

作者

  • H

    Huang, Lin (第一作者)

    nanjing univ aeronaut & astronaut

  • T

    Tang, Dunbing (通讯)

    nanjing univ aeronaut & astronaut

查看全部 6 位作者收起作者
  • Z

    Zhang, Zequn

    nanjing univ aeronaut & astronaut

  • Z

    Zhu, Haihua

    nanjing univ aeronaut & astronaut

  • C

    Cai, Qixiang

    nanjing univ aeronaut & astronaut

  • Z

    Zhao, Shikui

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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