Essognim Richard Wilouwou , Arwa Khannoussi , Alexandru-Liviu Olteanu , Marc Sevaux
{"title":"灵活的作业车间重新调度使用用户首选项","authors":"Essognim Richard Wilouwou , Arwa Khannoussi , Alexandru-Liviu Olteanu , Marc Sevaux","doi":"10.1016/j.cor.2025.107213","DOIUrl":null,"url":null,"abstract":"<div><div>We consider solving the flexible job shop scheduling problem, where new jobs arrive and must be inserted into the production line through rescheduling. The insertion of new jobs can cause instability in the workshop, which may lead to additional costs, operator fatigue, increased risk of errors, and customer dissatisfaction. Several metrics have been used to measure instability. These metrics can be conflicting, and their choice depends on the user. In this paper, we conduct an analysis considering the DM’s preferences regarding stability criteria, and assume that he expresses his preferences in the form of judgments (e.g. <em>very good</em>, <em>good</em>, <em>average</em>, or <em>bad</em>). Our formulation of stability criteria allows the DMs to interpret the solutions. The solutions potentially accepted by the DM need to excel in the efficiency criterion while achieving at least <em>good</em> quality on the stability criteria. We aggregate the decision-maker’s preferences on stability criteria using a sorting preference model called MRSort. We propose two approaches for integrating the DM’s preferences into the optimization process: an <em>a priori</em> approach and an <em>interactive</em> approach. We show that with the <em>a priori</em> approach, we are able to find solutions of at least <em>good</em> quality on 96% of small instances, 93% of medium instances, and 59% of large instances, but this can lead to losses in efficiency. With the interactive approach, we obtain solutions of at least good category in about 59% of instances for each size, but it requires multiple interactions if one aims to achieve solutions of at least <em>good</em> quality. This highlights the conflicting nature between efficiency and stability. The optimization is performed using a Variable Neighborhood Search with three types of neighborhood structures for local search.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"184 ","pages":"Article 107213"},"PeriodicalIF":4.3000,"publicationDate":"2025-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Flexible job shop rescheduling using user preferences\",\"authors\":\"Essognim Richard Wilouwou , Arwa Khannoussi , Alexandru-Liviu Olteanu , Marc Sevaux\",\"doi\":\"10.1016/j.cor.2025.107213\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>We consider solving the flexible job shop scheduling problem, where new jobs arrive and must be inserted into the production line through rescheduling. The insertion of new jobs can cause instability in the workshop, which may lead to additional costs, operator fatigue, increased risk of errors, and customer dissatisfaction. Several metrics have been used to measure instability. These metrics can be conflicting, and their choice depends on the user. In this paper, we conduct an analysis considering the DM’s preferences regarding stability criteria, and assume that he expresses his preferences in the form of judgments (e.g. <em>very good</em>, <em>good</em>, <em>average</em>, or <em>bad</em>). Our formulation of stability criteria allows the DMs to interpret the solutions. The solutions potentially accepted by the DM need to excel in the efficiency criterion while achieving at least <em>good</em> quality on the stability criteria. We aggregate the decision-maker’s preferences on stability criteria using a sorting preference model called MRSort. We propose two approaches for integrating the DM’s preferences into the optimization process: an <em>a priori</em> approach and an <em>interactive</em> approach. We show that with the <em>a priori</em> approach, we are able to find solutions of at least <em>good</em> quality on 96% of small instances, 93% of medium instances, and 59% of large instances, but this can lead to losses in efficiency. With the interactive approach, we obtain solutions of at least good category in about 59% of instances for each size, but it requires multiple interactions if one aims to achieve solutions of at least <em>good</em> quality. This highlights the conflicting nature between efficiency and stability. The optimization is performed using a Variable Neighborhood Search with three types of neighborhood structures for local search.</div></div>\",\"PeriodicalId\":10542,\"journal\":{\"name\":\"Computers & Operations Research\",\"volume\":\"184 \",\"pages\":\"Article 107213\"},\"PeriodicalIF\":4.3000,\"publicationDate\":\"2025-07-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Operations Research\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0305054825002412\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054825002412","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
Flexible job shop rescheduling using user preferences
We consider solving the flexible job shop scheduling problem, where new jobs arrive and must be inserted into the production line through rescheduling. The insertion of new jobs can cause instability in the workshop, which may lead to additional costs, operator fatigue, increased risk of errors, and customer dissatisfaction. Several metrics have been used to measure instability. These metrics can be conflicting, and their choice depends on the user. In this paper, we conduct an analysis considering the DM’s preferences regarding stability criteria, and assume that he expresses his preferences in the form of judgments (e.g. very good, good, average, or bad). Our formulation of stability criteria allows the DMs to interpret the solutions. The solutions potentially accepted by the DM need to excel in the efficiency criterion while achieving at least good quality on the stability criteria. We aggregate the decision-maker’s preferences on stability criteria using a sorting preference model called MRSort. We propose two approaches for integrating the DM’s preferences into the optimization process: an a priori approach and an interactive approach. We show that with the a priori approach, we are able to find solutions of at least good quality on 96% of small instances, 93% of medium instances, and 59% of large instances, but this can lead to losses in efficiency. With the interactive approach, we obtain solutions of at least good category in about 59% of instances for each size, but it requires multiple interactions if one aims to achieve solutions of at least good quality. This highlights the conflicting nature between efficiency and stability. The optimization is performed using a Variable Neighborhood Search with three types of neighborhood structures for local search.
期刊介绍:
Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.