具有场景相关发布日期的单机最大完成时间调度

IF 0.9 4区管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

Operations Research Letters Pub Date : 2025-08-06 DOI:10.1016/j.orl.2025.107353

Zhichao Geng, Yuan Gao

{"title":"具有场景相关发布日期的单机最大完成时间调度","authors":"Zhichao Geng, Yuan Gao","doi":"10.1016/j.orl.2025.107353","DOIUrl":null,"url":null,"abstract":"<div><div>This paper addresses the robust single-machine makespan scheduling problems, in which the processing times of jobs and a set of discrete scenarios are given, and the release dates of jobs are scenario-dependent. For three common criteria (absolute robustness, maximum regret and relative maximum regret) relevant to robust optimization approaches, we show that the corresponding problems are all polynomially solvable.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107353"},"PeriodicalIF":0.9000,"publicationDate":"2025-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Single-machine makespan scheduling with scenario-dependent release dates\",\"authors\":\"Zhichao Geng, Yuan Gao\",\"doi\":\"10.1016/j.orl.2025.107353\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This paper addresses the robust single-machine makespan scheduling problems, in which the processing times of jobs and a set of discrete scenarios are given, and the release dates of jobs are scenario-dependent. For three common criteria (absolute robustness, maximum regret and relative maximum regret) relevant to robust optimization approaches, we show that the corresponding problems are all polynomially solvable.</div></div>\",\"PeriodicalId\":54682,\"journal\":{\"name\":\"Operations Research Letters\",\"volume\":\"63 \",\"pages\":\"Article 107353\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2025-08-06\",\"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/S0167637725001142\",\"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/S0167637725001142","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}

引用次数: 0

摘要

本文研究了鲁棒单机最大完工时间调度问题，该问题给出了作业的处理时间和一组离散的场景，并且作业的发布日期是场景相关的。对于与鲁棒优化方法相关的三个常见准则（绝对鲁棒性、最大遗憾和相对最大遗憾），我们证明了相应的问题都是多项式可解的。

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

查看原文本刊更多论文

Single-machine makespan scheduling with scenario-dependent release dates

This paper addresses the robust single-machine makespan scheduling problems, in which the processing times of jobs and a set of discrete scenarios are given, and the release dates of jobs are scenario-dependent. For three common criteria (absolute robustness, maximum regret and relative maximum regret) relevant to robust optimization approaches, we show that the corresponding problems are all polynomially solvable.

求助全文

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

来源期刊

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.