单工序生产中优化排产与稳健排产之间的权衡

IF 1.9 Q3 ENGINEERING, MANUFACTURING
Wei Li , Barrie R. Nault
{"title":"单工序生产中优化排产与稳健排产之间的权衡","authors":"Wei Li ,&nbsp;Barrie R. Nault","doi":"10.1016/j.mfglet.2024.09.010","DOIUrl":null,"url":null,"abstract":"<div><div>Given stochastic disturbances, such as variation in processing times, robust scheduling is recommended over optimal scheduling for production. Different from optimal scheduling that seeks an optimal solution to a key performance indicator (KPI), which relates to the average of a KPI, robust scheduling is to minimize the largest deviation from the optimum for the worst-case scenarios, which relates to the variance of a KPI. However, minimizing the variance does not necessarily optimize the average of a KPI. As one of the fundamental KPIs in production scheduling, total completion time (<em>TCT</em>) drives many other KPIs, such as average flow time, waiting time, due dates, and length of stay. Stochastic processing times and <em>NP</em>-hardness to minimize the variance of <em>TCT</em>, i.e., <span><math><mrow><mi>min</mi><mo>(</mo><mi>VTCT</mi><mo>)</mo></mrow></math></span>, are two challenges in production scheduling. To investigate the trade-offs between optimal and robust scheduling, we apply the differentiation method to analyze the first and second moments of <em>TCT</em>. In our approach, we use three statistical measures for processing times, which are the lower bound, the expected value, and the upper bound. We also use three terms for sequencing, which are <span><math><mrow><mi>x</mi><mo>(</mo><mn>1</mn><mo>)</mo></mrow></math></span> the processing time of the initial job, <span><math><mrow><mi>x</mi><mo>(</mo><mi>i</mi><mo>)</mo></mrow></math></span> the processing time of a job in the current position <em>i</em> of a sequence, and <span><math><mrow><mi>x</mi><mo>′</mo><mo>(</mo><mi>i</mi><mo>)</mo></mrow></math></span> the difference of processing times between two adjacent jobs. Applying the three measures for processing times to each of the three independent terms for sequencing, we generate <span><math><mrow><mn>27</mn><mo>=</mo><mn>3</mn><mo>·</mo><mn>3</mn><mo>·</mo><mn>3</mn></mrow></math></span> sequences to analyze the dynamics of <em>VTCT</em>. Through numerical analysis in our case studies, we show that our sequencing scheme can generate optimal solutions to <span><math><mrow><mi>min</mi><mo>(</mo><mi>TCT</mi><mo>)</mo></mrow></math></span>, and solid variation ranges of <em>VTCT</em>. Consequently, we can not only balance the trade-offs between <span><math><mrow><mi>min</mi><mo>(</mo><mi>TCT</mi><mo>)</mo></mrow></math></span> and <span><math><mrow><mi>min</mi><mo>(</mo><mi>VTCT</mi><mo>)</mo></mrow></math></span>, but also analyze the trade-offs between optimal scheduling focusing on the first-moment of a KPI and robust scheduling focusing on the second moment. Moreover, our analysis approach using the differentiation method is unique for production scheduling, which enables us to develop analytical methods and heuristics for balancing trade-offs between optimal and robust scheduling.</div></div>","PeriodicalId":38186,"journal":{"name":"Manufacturing Letters","volume":"41 ","pages":"Pages 63-72"},"PeriodicalIF":1.9000,"publicationDate":"2024-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Trade-offs between optimal and robust scheduling in one-stage production\",\"authors\":\"Wei Li ,&nbsp;Barrie R. Nault\",\"doi\":\"10.1016/j.mfglet.2024.09.010\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Given stochastic disturbances, such as variation in processing times, robust scheduling is recommended over optimal scheduling for production. Different from optimal scheduling that seeks an optimal solution to a key performance indicator (KPI), which relates to the average of a KPI, robust scheduling is to minimize the largest deviation from the optimum for the worst-case scenarios, which relates to the variance of a KPI. However, minimizing the variance does not necessarily optimize the average of a KPI. As one of the fundamental KPIs in production scheduling, total completion time (<em>TCT</em>) drives many other KPIs, such as average flow time, waiting time, due dates, and length of stay. Stochastic processing times and <em>NP</em>-hardness to minimize the variance of <em>TCT</em>, i.e., <span><math><mrow><mi>min</mi><mo>(</mo><mi>VTCT</mi><mo>)</mo></mrow></math></span>, are two challenges in production scheduling. To investigate the trade-offs between optimal and robust scheduling, we apply the differentiation method to analyze the first and second moments of <em>TCT</em>. In our approach, we use three statistical measures for processing times, which are the lower bound, the expected value, and the upper bound. We also use three terms for sequencing, which are <span><math><mrow><mi>x</mi><mo>(</mo><mn>1</mn><mo>)</mo></mrow></math></span> the processing time of the initial job, <span><math><mrow><mi>x</mi><mo>(</mo><mi>i</mi><mo>)</mo></mrow></math></span> the processing time of a job in the current position <em>i</em> of a sequence, and <span><math><mrow><mi>x</mi><mo>′</mo><mo>(</mo><mi>i</mi><mo>)</mo></mrow></math></span> the difference of processing times between two adjacent jobs. Applying the three measures for processing times to each of the three independent terms for sequencing, we generate <span><math><mrow><mn>27</mn><mo>=</mo><mn>3</mn><mo>·</mo><mn>3</mn><mo>·</mo><mn>3</mn></mrow></math></span> sequences to analyze the dynamics of <em>VTCT</em>. Through numerical analysis in our case studies, we show that our sequencing scheme can generate optimal solutions to <span><math><mrow><mi>min</mi><mo>(</mo><mi>TCT</mi><mo>)</mo></mrow></math></span>, and solid variation ranges of <em>VTCT</em>. Consequently, we can not only balance the trade-offs between <span><math><mrow><mi>min</mi><mo>(</mo><mi>TCT</mi><mo>)</mo></mrow></math></span> and <span><math><mrow><mi>min</mi><mo>(</mo><mi>VTCT</mi><mo>)</mo></mrow></math></span>, but also analyze the trade-offs between optimal scheduling focusing on the first-moment of a KPI and robust scheduling focusing on the second moment. Moreover, our analysis approach using the differentiation method is unique for production scheduling, which enables us to develop analytical methods and heuristics for balancing trade-offs between optimal and robust scheduling.</div></div>\",\"PeriodicalId\":38186,\"journal\":{\"name\":\"Manufacturing Letters\",\"volume\":\"41 \",\"pages\":\"Pages 63-72\"},\"PeriodicalIF\":1.9000,\"publicationDate\":\"2024-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Manufacturing Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2213846324000671\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"ENGINEERING, MANUFACTURING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Manufacturing Letters","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2213846324000671","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, MANUFACTURING","Score":null,"Total":0}
引用次数: 0

摘要

考虑到随机干扰,如加工时间的变化,建议采用稳健排产,而不是最优排产。优化调度寻求的是关键绩效指标(KPI)的最优解,与关键绩效指标的平均值有关;而稳健调度则不同,它寻求的是最小化最坏情况下与最优解的最大偏差,与关键绩效指标的方差有关。然而,方差最小化并不一定能优化 KPI 的平均值。作为生产调度的基本 KPI 之一,总完成时间(TCT)驱动着许多其他 KPI,如平均流动时间、等待时间、到期日期和停留时间。随机处理时间和最小化 TCT 方差(即 min(VTCT))的 NP 难度是生产调度中的两大挑战。为了研究最优调度和稳健调度之间的权衡,我们采用微分法分析 TCT 的第一矩和第二矩。在我们的方法中,我们对处理时间使用了三个统计量,分别是下限、期望值和上限。我们还使用了三个排序项,分别是 x(1)初始作业的处理时间、x(i)排序中当前位置 i 的作业的处理时间和 x′(i)相邻两个作业的处理时间差。将处理时间的三个测量值分别应用于排序的三个独立项中,我们生成了 27=3-3-3 序列来分析 VTCT 的动态变化。通过案例研究中的数值分析,我们发现我们的排序方案可以生成 min(TCT)的最优解,以及 VTCT 的稳固变化范围。因此,我们不仅能平衡 min(TCT) 和 min(VTCT) 之间的权衡,还能分析侧重于关键绩效指标第一时刻的优化调度和侧重于第二时刻的稳健调度之间的权衡。此外,我们使用微分法的分析方法对于生产调度来说是独一无二的,这使我们能够开发出平衡最优调度和稳健调度之间权衡的分析方法和启发式方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Trade-offs between optimal and robust scheduling in one-stage production
Given stochastic disturbances, such as variation in processing times, robust scheduling is recommended over optimal scheduling for production. Different from optimal scheduling that seeks an optimal solution to a key performance indicator (KPI), which relates to the average of a KPI, robust scheduling is to minimize the largest deviation from the optimum for the worst-case scenarios, which relates to the variance of a KPI. However, minimizing the variance does not necessarily optimize the average of a KPI. As one of the fundamental KPIs in production scheduling, total completion time (TCT) drives many other KPIs, such as average flow time, waiting time, due dates, and length of stay. Stochastic processing times and NP-hardness to minimize the variance of TCT, i.e., min(VTCT), are two challenges in production scheduling. To investigate the trade-offs between optimal and robust scheduling, we apply the differentiation method to analyze the first and second moments of TCT. In our approach, we use three statistical measures for processing times, which are the lower bound, the expected value, and the upper bound. We also use three terms for sequencing, which are x(1) the processing time of the initial job, x(i) the processing time of a job in the current position i of a sequence, and x(i) the difference of processing times between two adjacent jobs. Applying the three measures for processing times to each of the three independent terms for sequencing, we generate 27=3·3·3 sequences to analyze the dynamics of VTCT. Through numerical analysis in our case studies, we show that our sequencing scheme can generate optimal solutions to min(TCT), and solid variation ranges of VTCT. Consequently, we can not only balance the trade-offs between min(TCT) and min(VTCT), but also analyze the trade-offs between optimal scheduling focusing on the first-moment of a KPI and robust scheduling focusing on the second moment. Moreover, our analysis approach using the differentiation method is unique for production scheduling, which enables us to develop analytical methods and heuristics for balancing trade-offs between optimal and robust scheduling.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Manufacturing Letters
Manufacturing Letters Engineering-Industrial and Manufacturing Engineering
CiteScore
4.20
自引率
5.10%
发文量
192
审稿时长
60 days
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信