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

Swarm intelligent based metaheuristics for a bi-objective flexible job shop integrated supply chain scheduling problems

Mahmud, Shahed*; Chakrabortty, Ripon K.; Abbasi, Alireza; Ryan, Michael J.
APPLIED SOFT COMPUTING2022-5DOI: 10.1016/j.asoc.2022.108794
15被引3阅读
引用收藏
分享

摘要

This study introduces a bi-objective integrated supply chain (SC) scheduling (SCS) model to deal with the challenges of providing highly customized and on-time delivery requirements at the least cost. To address these real-life challenges, the model integrates the supply portfolio into production scheduling with a customer-imposed delivery time A set of conflicting factors is considered for the SC in which the manufacturer is modeled using the flexible job shop (FJS) problem to include greater flexibility in process routing. Since the proposed SCS model extends the strongly NP-hard FJS problem, two new meta-heuristic algorithms are developed, enhancing the performance of the multi-objective particle swarm optimization (MOPSO). A Tabu search inspired search mechanism and a problem-specific mutation operator are designed in both algorithms. As inadequate archive diversity leads to premature convergence and unsatisfactory Pareto solutions in many cases, this work employs two practical approaches separately (i.e., crowding distance (CD) and niche count preservation of reference point (RP)) in the proposed MOPSOs, called CD-MOPSO and RP-MOPSO, respectively. For leader selection, CD-MOPSO uses the swarm distance-based Roulette wheel, whereas the concept of RP is proposed in RP-MOPSO to expedite convergence. The performances of the proposed algorithms are validated against four existing algorithms and assessed by utilizing several criteria after solving 45 artificial instances. The simulation results and statistical analysis demonstrate the supremacy of the RP-MOPSO which increases the flexibility for a decision-maker in providing a higher number of Pareto solutions and more diverse and regular frontiers within reasonable computational time. Finally, a sensitivity analysis of the model is conducted, and managerial insights are provided.

学科与关键词

关键词
Supply chain schedulingSupplier selectionFlexible job shop schedulingMulti-objective optimizationMOPSO
相关
加载中…

文献加载失败,请重试

重试

发表信息

论文状态
公开发表
期刊
APPLIED SOFT COMPUTING
发表日期
2022-05
卷期
第 121 卷
页码
108794
DOI
10.1016/j.asoc.2022.108794
语言
ENGLISH
期刊等级
2区
成果收录
SCIE

作者

  • M

    Mahmud, Shahed (通讯) (第一作者)

  • C

    Chakrabortty, Ripon K.

查看全部 4 位作者收起作者
  • A

    Abbasi, Alireza

  • R

    Ryan, Michael J.

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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