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

Mathematical modeling and a hybridized bacterial foraging optimization algorithm for the flexible job-shop scheduling problem with sequencing flexibility

Vital-Soto, Alejandro; Azab, Ahmed*; Baki, Mohammed Fazle
JOURNAL OF MANUFACTURING SYSTEMS2020-1DOI: 10.1016/j.jmsy.2019.11.010
50被引2阅读
引用收藏
分享

摘要

The flexible job-shop scheduling problem (FJSP) is an extension of the classical job-shop scheduling problem (JSP) in which operations can be performed by a set of candidate capable machines. An extended version of the FJSP, entitled sequencing flexibility, is studied in this work, which considers precedence between the operations in the form of a directed acyclic graph instead of a sequential order. In this work, a mixed integer linear programming (MILP) formulation is presented to minimize weighted tardiness for the FJSP with sequencing flexibility. Due to the NP-hardness of the problem, a novel biomimicry hybrid bacterial foraging optimization algorithm (HBFOA) is developed, which is inspired by the behavior of E. colt bacteria in its search for food. The developed HBFOA search method is hybridized with simulated annealing (SA). Additionally, the algorithm has been enhanced by a local search method based on the manipulation of critical operations. Classical dispatching rules have been employed to create the initial swarm of HBFOA, and a new dispatching rule named minimum number of operations has been devised. The developed approach has been packaged in the form of a decision support system (DSS) developed on top of Microsoft Excel-a tool most small and mid-range enterprises (SME) use heavily for planning. A case study with local industry is presented to validate the proposed HBFOA and MILP. Additional numerical experiments using literature benchmarks are further used for validation. The results demonstrate that the HBFOA outperformed the classical dispatching rules and the best integer solution of MILP when minimizing the weighted tardiness and offered comparable results for the makespan instances.

学科与关键词

关键词
Flexible job-shop scheduling problemSequencing-flexibilityBacterial foraging optimization algorithmSimulated annealingWeighted tardinessDecision support system
相关
加载中…
  • Mathematical modeling and hybrid evolutionary algorithm to schedule flexible job shop with discrete operation sequence flexibility
    Yuan, Shuai; Zhu, Xiaomin; Cai, Wei; Gao, Jinsheng; Zhang, Runtong*COMPUTERS & OPERATIONS RESEARCH, 2025, 176: 106952.
  • FLEXIBLE JOB SHOP SCHEDULING BASED ON DIGITAL TWIN AND IMPROVED BACTERIAL FORAGING
    Huo, L.*; Wang, J. Y.International Journal of Simulation Modelling, 2022, 21(3): 525-536.被引 10
  • A Modified Biogeography-Based Optimization for the Flexible Job Shop Scheduling Problem
    Yang, Yuzhen*MATHEMATICAL PROBLEMS IN ENGINEERING, 2015, 2015: 184643.被引 8
查看全部 →

发表信息

论文状态
公开发表
期刊
JOURNAL OF MANUFACTURING SYSTEMS
发表日期
2020-01
卷期
第 54 卷
页码
74-93
DOI
10.1016/j.jmsy.2019.11.010
语言
ENGLISH
期刊收录
NSL.SCIE
期刊等级
2区
成果收录
SCIE
资助标注
National Council of Science and Technology of Mexico (CONACyT); Natural Sciences and Engineering Research Council of Canada (NSERC); Ontario Centres of Excellence (OCE)

作者

  • V

    Vital-Soto, Alejandro (第一作者)

  • A

    Azab, Ahmed (通讯)

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

    Baki, Mohammed Fazle

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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