具有不可用时段的锚定重新安排问题

IF 0.8 4区管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Operations Research Letters Pub Date : 2024-11-01 DOI:10.1016/j.orl.2024.107201

Pascale Bendotti , Luca Brunod Indrigo , Philippe Chrétienne , Bruno Escoffier

{"title":"具有不可用时段的锚定重新安排问题","authors":"Pascale Bendotti , Luca Brunod Indrigo , Philippe Chrétienne , Bruno Escoffier","doi":"10.1016/j.orl.2024.107201","DOIUrl":null,"url":null,"abstract":"<div><div>A set of jobs with precedence constraints is given along with a baseline schedule, resulting from the first-stage decision of a robust two-stage scheduling problem. Non-availability periods caused by unpredicted disruptions prevent jobs from being executed on certain time intervals, thus requiring rescheduling. The anchored rescheduling problem with non-availability periods is to find a schedule maximizing the number of so-called anchored jobs whose starting times remain close to the baseline schedule. It is shown to be solvable in polynomial time.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":null,"pages":null},"PeriodicalIF":0.8000,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Anchored rescheduling problem with non-availability periods\",\"authors\":\"Pascale Bendotti , Luca Brunod Indrigo , Philippe Chrétienne , Bruno Escoffier\",\"doi\":\"10.1016/j.orl.2024.107201\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>A set of jobs with precedence constraints is given along with a baseline schedule, resulting from the first-stage decision of a robust two-stage scheduling problem. Non-availability periods caused by unpredicted disruptions prevent jobs from being executed on certain time intervals, thus requiring rescheduling. The anchored rescheduling problem with non-availability periods is to find a schedule maximizing the number of so-called anchored jobs whose starting times remain close to the baseline schedule. It is shown to be solvable in polynomial time.</div></div>\",\"PeriodicalId\":54682,\"journal\":{\"name\":\"Operations Research Letters\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2024-11-01\",\"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/S0167637724001378\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Letters","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167637724001378","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}

引用次数: 0

摘要

在一个稳健的两阶段调度问题的第一阶段决策中，给出了一组具有优先级限制的作业和一个基准调度。由于不可预知的干扰导致不可用时段，工作无法在某些时间间隔内执行，因此需要重新排程。具有不可用时段的锚定重新调度问题是要找到一个调度方案，最大限度地增加起始时间与基准调度方案接近的所谓锚定作业的数量。该问题可在多项式时间内求解。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Anchored rescheduling problem with non-availability periods

A set of jobs with precedence constraints is given along with a baseline schedule, resulting from the first-stage decision of a robust two-stage scheduling problem. Non-availability periods caused by unpredicted disruptions prevent jobs from being executed on certain time intervals, thus requiring rescheduling. The anchored rescheduling problem with non-availability periods is to find a schedule maximizing the number of so-called anchored jobs whose starting times remain close to the baseline schedule. It is shown to be solvable in polynomial time.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Operations Research Letters 管理科学-运筹学与管理科学

CiteScore

2.10

自引率

9.10%

发文量

111

审稿时长

83 days

期刊介绍： 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.