发布求助
文献互助 智能选刊 最新文献

Journal of Scheduling最新文献

筛选
英文 中文
A proven optimal result for a benchmark instance of the uncapacitated examination timetabling problem 无限制考试时间安排问题基准实例的最优结果证明
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2024-03-11 DOI: 10.1007/s10951-024-00805-0
Angelos Dimitsas, Christos Gogos, Christos Valouxis, Vasileios Nastos, Panayiotis Alefragis
{"title":"A proven optimal result for a benchmark instance of the uncapacitated examination timetabling problem","authors":"Angelos Dimitsas, Christos Gogos, Christos Valouxis, Vasileios Nastos, Panayiotis Alefragis","doi":"10.1007/s10951-024-00805-0","DOIUrl":"https://doi.org/10.1007/s10951-024-00805-0","url":null,"abstract":"<p>Examination timetabling is a problem well known to the scheduling community. Its simplest version, which is the uncapacitated examination timetabling problem, is easily described and comprehended. Nevertheless, proof of optimality is notoriously difficult even for moderate size problems. In this paper, we describe the effort that our team exercised in finally proving the optimality of the sta83 instance of Carter’s dataset. The problem was decomposed naturally in three parts and for each part a different approach managed to prove optimality of the currently best known solution. This work also presents optimal solutions to subproblems that exist in various public datasets problems and two best known solutions of such problems.</p>","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140127797","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}
引用次数: 0
A novel and efficient real-time sequencing strategy for appointment scheduling with unpunctual patients 针对不守时患者的预约排程的高效实时排序新策略
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2024-02-26 DOI: 10.1007/s10951-023-00802-9
{"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":null,"pages":null},"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}
引用次数: 0
A scheduling framework for distributed key-value stores and its application to tail latency minimization 分布式键值存储的调度框架及其在尾部延迟最小化中的应用
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2024-02-26 DOI: 10.1007/s10951-023-00803-8
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":null,"pages":null},"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}
引用次数: 0
Continuity of care in home health care scheduling: a rolling horizon approach 居家医疗护理排班中的持续护理：滚动视野法
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2024-01-27 DOI: 10.1007/s10951-023-00796-4
Şeyma Güven-Koçak, Aliza Heching, Pınar Keskinocak, Alejandro Toriello
{"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":null,"pages":null},"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}
引用次数: 0
Scheduling the repair and replacement of individual components in operating systems: a bi-objective mathematical optimization model 安排操作系统中单个组件的维修和更换：双目标数学优化模型
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2023-12-21 DOI: 10.1007/s10951-023-00800-x
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":null,"pages":null},"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}
引用次数: 0
Multi-neighbourhood simulated annealing for the ITC-2007 capacitated examination timetabling problem 多邻域模拟退火法解决 ITC-2007 年容纳性考试时间安排问题
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2023-12-19 DOI: 10.1007/s10951-023-00799-1
{"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":null,"pages":null},"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}
引用次数: 0
Dynamic scheduling problems in theory and practice 理论与实践中的动态调度问题
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2023-12-14 DOI: 10.1007/s10951-023-00798-2
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":null,"pages":null},"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}
引用次数: 0
Mathematical challenges in scheduling theory 调度理论的数学挑战
IF 2 4区 工程技术
Journal of Scheduling Pub Date : 2023-11-19 DOI: 10.1007/s10951-023-00797-3
Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang
{"title":"Mathematical challenges in scheduling theory","authors":"Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang","doi":"10.1007/s10951-023-00797-3","DOIUrl":"https://doi.org/10.1007/s10951-023-00797-3","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2023-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139259830","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}
引用次数: 0
The price of anarchy for a berth allocation game 泊位分配博弈的无政府状态的代价
4区 工程技术
Journal of Scheduling Pub Date : 2023-11-09 DOI: 10.1007/s10951-023-00791-9
Jiayin Pan, Cong Chen, Yinfeng Xu
{"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":null,"pages":null},"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}
引用次数: 0
A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing 离散制造无步进流程车间调度目标的综述与分类
4区 工程技术
Journal of Scheduling Pub Date : 2023-11-06 DOI: 10.1007/s10951-023-00795-5
Frederik Ferid Ostermeier, Jochen Deuse
{"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":null,"pages":null},"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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信