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

A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources

Fontes, Dalila B. M. M.*; Homayouni, S. Mahdi; Goncalves, Jose F.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH2023-5-1DOI: 10.1016/j.ejor.2022.09.006
68被引6阅读
引用收藏
分享

摘要

This work addresses a variant of the job shop scheduling problem in which jobs need to be transported to the machines processing their operations by a limited number of vehicles. Given that vehicles must deliver the jobs to the machines for processing and that machines need to finish processing the jobs before they can be transported, machine scheduling and vehicle scheduling are intertwined. A coordi-nated approach that solves these interrelated problems simultaneously improves the overall performance of the manufacturing system. In the current competitive business environment, and integrated approach is imperative as it boosts cost savings and on-time deliveries. Hence, the job shop scheduling problem with transport resources (JSPT) requires scheduling production operations and transport tasks simultane-ously. The JSPT is studied considering the minimization of two alternative performance metrics, namely: makespan and exit time. Optimal solutions are found by a mixed integer linear programming (MILP) model. However, since integrated production and transportation scheduling is very complex, the MILP model can only handle small-sized problem instances. To find good quality solutions in reasonable com-putation times, we propose a hybrid particle swarm optimization and simulated annealing algorithm (PSOSA). Furthermore, we derive a fast lower bounding procedure that can be used to evaluate the perfor-mance of the heuristic solutions for larger instances. Extensive computational experiments are conducted on 73 benchmark instances, for each of the two performance metrics, to assess the efficacy and efficiency of the proposed PSOSA algorithm. These experiments show that the PSOSA outperforms state-of-the-art solution approaches and is very robust.

学科与关键词

关键词
SchedulingJob shop scheduling with transportresourcesJoint production and transport schedulingParticle swarm optimizationSimulated annealing
相关
加载中…
  • A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMS
    Ge, H. W.; Liang, Y. C.*; Zhou, Y.; Guo, X. C.International Journal of Computational Methods, 2005, 2(3): 419-430.被引 20
  • Concurrent scheduling of jobs and AGVs in a flexible job shop system: a parallel hybrid PSO-GA meta-heuristic
    Amirteimoori, Arash*; Kia, RezaFlexible Services and Manufacturing Journal, 2023, 35(3): 727-753.被引 10
  • Joint optimisation for dynamic flexible job-shop scheduling problem with transportation time and resource constraints
    Ren, Weibo; Yan, Yan; Hu, Yaoguang*; Guan, YuInternational Journal of Production Research, 2022, 60(18): 5675-5696.被引 51
查看全部 →

发表信息

论文状态
公开发表
期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
发表日期
2023-05-01
卷期
第 306 卷, 第 3 期
页码
1140-1157
DOI
10.1016/j.ejor.2022.09.006
语言
ENGLISH
成果收录
SCIE
资助标注
ERDF European Regional Development Fund through the Operational Programme for Competitiveness and Internationalisation-COMPETE 2020 Programme; FCT -Fundacao para a Ciencia e a Tecnologia [POCI-01-0145-FEDER-031821-PTDC/EGE-OGE/31821/2017, POCI-01-0145-FEDER-031447-PTDC/EEI-AUT/31447/2017]

作者

  • F

    Fontes, Dalila B. M. M. (通讯) (第一作者)

  • H

    Homayouni, S. Mahdi

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

    Goncalves, Jose F.

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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