{"title":"单工序生产中优化排产与稳健排产之间的权衡","authors":"Wei Li , 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 , 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}
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., , 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 the processing time of the initial job, the processing time of a job in the current position i of a sequence, and 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 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 , and solid variation ranges of VTCT. Consequently, we can not only balance the trade-offs between and , 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.