A robust optimization method for hybrid flow shop scheduling with uncertain setup times

Shiva Rahmativala , Javid Ghahremani
{"title":"A robust optimization method for hybrid flow shop scheduling with uncertain setup times","authors":"Shiva Rahmativala ,&nbsp;Javid Ghahremani","doi":"10.1016/j.dajour.2025.100609","DOIUrl":null,"url":null,"abstract":"<div><div>This research focuses on modeling and solving a bi-objective hybrid flow shop scheduling problem, considering uncertain job-dependent setup times and worker constraints. The main objective of the mathematical model is to simultaneously minimize the Maximum Completion Time (Cmax) and minimize the total tardiness. To achieve both objective functions simultaneously, various decisions are made, including scheduling the processing of jobs in each stage, assigning jobs to machines, and assigning workers in each stage. Uncertainty in the job-dependent setup time leads to the use of a robust-box optimization method to control this parameter. In addition, this paper proposes four algorithms, Non-dominated Sorting Genetic Algorithm II (NSGA-II), Multi Objective Particle Swarm Optimization (MOPSO), Multi-Objective Grey Wolf Optimizer (MOGWO), and Multi-Objective Flow Direction Algorithm (MOFDA), to solve the problem. The results of solving the problem on 15 sample problems show that decreasing the total tardiness value increases the Cmax value. This is due to changes in the scheduling of job processing by machines and workers in different stages. Also, by comparing the efficient solutions obtained from different algorithms and examining the indices, it was observed that the MOFDA has higher efficiency in obtaining the Number of Pareto Front (NPF) and Maximum spread Index (MSI) indices. However, the Computational time (CPT) and Space Metric (SM) indices in this algorithm was higher compared to other algorithms. Also, the quality of the solutions obtained from this algorithm was higher compared to other algorithms and was selected as the more efficient algorithm. By examining the uncertainty rate in the job-dependent setup time analysis, it was observed that increasing this rate increases the Cmax and total tardiness values. So that, increasing the uncertainty rate from 0.5 to 0.9 leads to an 8.36% increase in the Cmax value and a 15.81% increase in the total tardiness value. The results of this model can help managers in appropriate scheduling of job processing in production units.</div></div>","PeriodicalId":100357,"journal":{"name":"Decision Analytics Journal","volume":"16 ","pages":"Article 100609"},"PeriodicalIF":0.0000,"publicationDate":"2025-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Decision Analytics Journal","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2772662225000657","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This research focuses on modeling and solving a bi-objective hybrid flow shop scheduling problem, considering uncertain job-dependent setup times and worker constraints. The main objective of the mathematical model is to simultaneously minimize the Maximum Completion Time (Cmax) and minimize the total tardiness. To achieve both objective functions simultaneously, various decisions are made, including scheduling the processing of jobs in each stage, assigning jobs to machines, and assigning workers in each stage. Uncertainty in the job-dependent setup time leads to the use of a robust-box optimization method to control this parameter. In addition, this paper proposes four algorithms, Non-dominated Sorting Genetic Algorithm II (NSGA-II), Multi Objective Particle Swarm Optimization (MOPSO), Multi-Objective Grey Wolf Optimizer (MOGWO), and Multi-Objective Flow Direction Algorithm (MOFDA), to solve the problem. The results of solving the problem on 15 sample problems show that decreasing the total tardiness value increases the Cmax value. This is due to changes in the scheduling of job processing by machines and workers in different stages. Also, by comparing the efficient solutions obtained from different algorithms and examining the indices, it was observed that the MOFDA has higher efficiency in obtaining the Number of Pareto Front (NPF) and Maximum spread Index (MSI) indices. However, the Computational time (CPT) and Space Metric (SM) indices in this algorithm was higher compared to other algorithms. Also, the quality of the solutions obtained from this algorithm was higher compared to other algorithms and was selected as the more efficient algorithm. By examining the uncertainty rate in the job-dependent setup time analysis, it was observed that increasing this rate increases the Cmax and total tardiness values. So that, increasing the uncertainty rate from 0.5 to 0.9 leads to an 8.36% increase in the Cmax value and a 15.81% increase in the total tardiness value. The results of this model can help managers in appropriate scheduling of job processing in production units.
不确定装配时间下混合流水车间调度的鲁棒优化方法
本文研究了一个考虑不确定作业相关设置时间和工人约束的双目标混合流水车间调度问题的建模和求解。该数学模型的主要目标是同时最小化最大完工时间(Cmax)和最小化总延误。为了同时实现这两个目标功能,需要进行各种决策,包括调度各阶段作业的加工,给机器分配作业,以及在各阶段分配工人。作业相关设置时间的不确定性导致使用鲁棒盒优化方法来控制该参数。此外,本文还提出了非支配排序遗传算法II (NSGA-II)、多目标粒子群优化算法(MOPSO)、多目标灰狼优化算法(MOGWO)和多目标流向算法(MOFDA)四种算法来解决这一问题。对15个样本问题的求解结果表明,总延迟值越小,Cmax值越高。这是由于机器和工人在不同阶段的作业处理调度的变化。此外,通过比较不同算法的有效解和对指标的检验,发现MOFDA在获取Pareto Front (NPF)数和Maximum spread Index (MSI)指标方面具有更高的效率。然而,与其他算法相比,该算法的计算时间(CPT)和空间度量(SM)指标较高。与其他算法相比,该算法得到的解质量更高,被选为效率更高的算法。通过考察作业相关设置时间分析中的不确定率,发现不确定率的增加会增加Cmax和总延迟值。因此,当不确定率由0.5增加到0.9时,Cmax值增加8.36%,总延迟值增加15.81%。该模型的结果可以帮助管理者对生产单位的作业加工进行适当的调度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
3.90
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信