Igor Malheiros , Artur Pessoa , Michaël Poss , Anand Subramanian
{"title":"Computing the worst-case due dates violations with budget uncertainty","authors":"Igor Malheiros , Artur Pessoa , Michaël Poss , Anand Subramanian","doi":"10.1016/j.orl.2024.107148","DOIUrl":null,"url":null,"abstract":"<div><p>We study the problem of maximizing the violation of due dates when considering either the total violation, or the number of jobs that are tardy. We consider classical completion times and a variant useful in heuristics. The four problems arise when solving (exactly or heuristically) robust scheduling problems with release and due dates/deadlines and processing time uncertainty, and also routing problems with (soft) time windows and travel time uncertainty. We provide polynomial dynamic programming algorithms for the four problems.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"56 ","pages":"Article 107148"},"PeriodicalIF":0.8000,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Letters","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167637724000841","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0
Abstract
We study the problem of maximizing the violation of due dates when considering either the total violation, or the number of jobs that are tardy. We consider classical completion times and a variant useful in heuristics. The four problems arise when solving (exactly or heuristically) robust scheduling problems with release and due dates/deadlines and processing time uncertainty, and also routing problems with (soft) time windows and travel time uncertainty. We provide polynomial dynamic programming algorithms for the four problems.
期刊介绍：
Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics. Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published. ORL covers the broad field of optimization, stochastic models and game theory. Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering. We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities. Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies. We also welcome novel applications and concise literature reviews.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
