{"title":"A novel and efficient real-time sequencing strategy for appointment scheduling with unpunctual patients","authors":"","doi":"10.1007/s10951-023-00802-9","DOIUrl":"https://doi.org/10.1007/s10951-023-00802-9","url":null,"abstract":"<h3>Abstract</h3> <p>No-shows and non-punctual appointments have always been uncertain factors faced by managers of service-oriented enterprises and institutions, which usually lead to a low utilization rate of resources and a rapid decline in service satisfaction. Taking clinics as an example, this paper proposes a novel and efficient real-time sequencing strategy to minimize the cost associated with patient waiting time, provider idle time and overtime considering no-shows and unpunctuality. Four types of patient waiting time are considered for the first time, based on which the developed real-time sequencing strategy is used for scheduling the waiting patients when the provider becomes idle. Then, a biased random-key genetic algorithm is adopted to determine the number of patients on appointment slots and the length of each appointment slot. Extensive computational experiments show that the derived real-time sequencing strategy achieves a significant cost reduction compared with the famous FCFS (first come first served) and the state-of-art LAR (the larger of appointment time and real arrival time) rules.</p>","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"134 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2024-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139968252","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sonia Ben Mokhtar, Louis-Claude Canon, Anthony Dugois, Loris Marchal, Etienne Rivière
{"title":"A scheduling framework for distributed key-value stores and its application to tail latency minimization","authors":"Sonia Ben Mokhtar, Louis-Claude Canon, Anthony Dugois, Loris Marchal, Etienne Rivière","doi":"10.1007/s10951-023-00803-8","DOIUrl":"https://doi.org/10.1007/s10951-023-00803-8","url":null,"abstract":"<p>Distributed key-value stores employ replication for high availability. Yet, they do not always efficiently take advantage of the availability of multiple replicas for each value and read operations often exhibit high tail latencies. Various replica selection strategies have been proposed to address this problem, together with local request scheduling policies. It is difficult, however, to determine what is the absolute performance gain each of these strategies can achieve. We present a formal framework allowing the systematic study of request scheduling strategies in key-value stores. We contribute a definition of the optimization problem related to reducing tail latency in a replicated key-value store as a minimization problem with respect to the maximum weighted flow criterion. By using scheduling theory, we show the difficulty of this problem and therefore the need to develop performance guarantees. We also study the behavior of heuristic methods using simulations that highlight which properties enable limiting tail latency: for instance, the <span>EarliestFinishTime</span> strategy—which uses the earliest next available time of servers—exhibits a tail latency that is less than half that of state-of-the-art strategies, often matching the lower bound. Our study also emphasizes the importance of metrics such as the stretch to properly evaluate replica selection and local execution policies.</p>","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"142 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2024-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139968716","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Continuity of care in home health care scheduling: a rolling horizon approach","authors":"Şeyma Güven-Koçak, Aliza Heching, Pınar Keskinocak, Alejandro Toriello","doi":"10.1007/s10951-023-00796-4","DOIUrl":"https://doi.org/10.1007/s10951-023-00796-4","url":null,"abstract":"<p>This work addresses a home health care scheduling problem faced by home care agencies. In home health care scheduling, there is a desire to retain consistency with respect to the home health aide servicing each patient; this consistency is referred to as <i>continuity of care</i>. To address this preference for continuity of care, we propose a rolling horizon approach to the scheduling problem and introduce the consistent home health care scheduling problem (Con-HHCSP). The goal is to be able to quantify and control the deviation of the new schedule suggested each day from the existing schedule in place, so that some of the existing assignments may be retained in the new schedule that is produced. We present two different methods to solve Con-HHCSP on a daily basis: an integer programming-based method with approximations and a variant of a petal heuristic. We discuss the performance and computational efficiency of these methods.</p>","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"3 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2024-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139579046","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Gabrijela Obradović, Ann-Brith Strömberg, Kristian Lundberg
{"title":"Scheduling the repair and replacement of individual components in operating systems: a bi-objective mathematical optimization model","authors":"Gabrijela Obradović, Ann-Brith Strömberg, Kristian Lundberg","doi":"10.1007/s10951-023-00800-x","DOIUrl":"https://doi.org/10.1007/s10951-023-00800-x","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"13 5","pages":""},"PeriodicalIF":2.0,"publicationDate":"2023-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138951804","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multi-neighbourhood simulated annealing for the ITC-2007 capacitated examination timetabling problem","authors":"","doi":"10.1007/s10951-023-00799-1","DOIUrl":"https://doi.org/10.1007/s10951-023-00799-1","url":null,"abstract":"<h3>Abstract</h3> <p>We propose a multi-neighbourhood simulated annealing algorithm for the ITC-2007 version of the capacitated examination timetabling problem. The proposed solver is based on a combination of existing as well as newly proposed neighbourhoods that better exploit the disconnected structure of the underlying conflict graph and that explicitly deal with the assignment of exams to rooms. We use a principled tuning procedure to determine the parameters of the algorithm and assess the contribution of the various neighbourhoods by means of an ablation analysis. The resulting algorithm is able to compete with existing state-of-the-art solvers and finds several new best solutions for a variety of well-known problem instances.</p>","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"11 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2023-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138820206","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Stanisław Gawiejnowicz, Bertrand Miao-Tsong Lin, G. Mosheiov
{"title":"Dynamic scheduling problems in theory and practice","authors":"Stanisław Gawiejnowicz, Bertrand Miao-Tsong Lin, G. Mosheiov","doi":"10.1007/s10951-023-00798-2","DOIUrl":"https://doi.org/10.1007/s10951-023-00798-2","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"47 4","pages":""},"PeriodicalIF":2.0,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138972529","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The price of anarchy for a berth allocation game","authors":"Jiayin Pan, Cong Chen, Yinfeng Xu","doi":"10.1007/s10951-023-00791-9","DOIUrl":"https://doi.org/10.1007/s10951-023-00791-9","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":" 47","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135192922","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing","authors":"Frederik Ferid Ostermeier, Jochen Deuse","doi":"10.1007/s10951-023-00795-5","DOIUrl":"https://doi.org/10.1007/s10951-023-00795-5","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"2 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135589993","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hongkai Fan, Dong Li, Bo Ouyang, Zhi Yan, Yaonan Wang
{"title":"Improving scheduling in multi-AGV systems by task prediction","authors":"Hongkai Fan, Dong Li, Bo Ouyang, Zhi Yan, Yaonan Wang","doi":"10.1007/s10951-023-00792-8","DOIUrl":"https://doi.org/10.1007/s10951-023-00792-8","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"33 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135589713","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}