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

Two meta-heuristic algorithms for optimizing a multi-objective supply chain scheduling problem in an identical parallel machines environment

Farmand, Nima*; Zarei, Hamid; Rasti-Barzoki, Morteza
International Journal of Industrial Engineering Computations2021DOI: 10.5267/j.ijiec.2021.3.002
12被引2阅读
引用收藏
分享

摘要

Optimizing the trade-off between crucial decisions has been a prominent issue to help decision-makers for synchronizing the production scheduling and distribution planning in supply chain management. In this article, a bi-objective integrated scheduling problem of production and distribution is addressed in a production environment with identical parallel machines. Besides, two objective functions are considered as measures for customer satisfaction and reduction of the manufacturer's costs. The first objective is considered aiming at minimizing the total weighted tardiness and total operation time. The second objective is considered aiming at minimizing the total cost of the company's reputational damage due to the number of tardy orders, total earliness penalty, and total batch delivery costs. First, a mathematical programming model is developed for the problem. Then, two well-known meta-heuristic algorithms are designed to spot near-optimal solutions since the problem is strongly NP-hard. A multi-objective particle swarm optimization (MOPSO) is designed using a mutation function, followed by a non-dominated sorting genetic algorithm (NSGA-II) with a one-point crossover operator and a heuristic mutation operator. The experiments on MOPSO and NSGA-II are carried out on small, medium, and large scale problems. Moreover, the performance of the two algorithms is compared according to some comparing criteria. The computational results reveal that the NSGA-II performs highly better than the MOPSO algorithm in small scale problems. In the case of medium and large scale problems, the efficiency of the MOPSO algorithm was significantly improved. Nevertheless, the NSGA-II performs robustly in the most important criteria.

学科与关键词

关键词
Multi-objective optimizationSupply chain schedulingNSGA-IIMOPSOSupply chain management
相关
加载中…
  • Mathematical programming and three metaheuristic algorithms for a bi-objective supply chain scheduling problem
    Zarei, Hamid; Rasti-Barzoki, Morteza*NEURAL COMPUTING & APPLICATIONS, 2019, 31(12): 9073-9093.被引 12
  • 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 COMPUTING, 2022, 121: 108794.被引 15
  • A bi-objective model for a multi-echelon supply chain design considering efficiency and customer satisfaction: a case study in plastic parts industry
    Ebrahimi, Seyed Babak*INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2018, 95(9-12): 3631-3649.被引 11
查看全部 →

发表信息

论文状态
公开发表
期刊
International Journal of Industrial Engineering Computations
发表日期
2021
卷期
第 12 卷, 第 3 期
页码
249-272
DOI
10.5267/j.ijiec.2021.3.002
期刊收录
NSL
期刊等级
4区
成果收录
SCIE

作者

  • F

    Farmand, Nima (通讯) (第一作者)

  • Z

    Zarei, Hamid

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

    Rasti-Barzoki, Morteza

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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