{"title":"Scheduling problems on parallel dedicated machines with non-renewable resource","authors":"Baruch Mor, Joanna Berlińska","doi":"10.1007/s10479-025-06471-5","DOIUrl":null,"url":null,"abstract":"<div><p>We study scheduling problems on <i>parallel dedicated</i> machines and assume that a specific job can only be processed on one specific machine. We concentrate on solving scheduling problems involving <i>convex resource allocation</i> and address three of the most fundamental measures in scheduling theory, i.e., makespan, total load, and total weighted completion time. Firstly, we focus on <i>position-independent workloads,</i> and then we study the setting of <i>general position-dependent workloads</i>, i.e., the workloads are not restricted to be either monotone functions of the job positions or any specific functions. In all problems, we assume a common <i>continuous</i> and <i>non-renewable</i> (limited) resource and adapt known results from scheduling theory to solve the considered problems.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"346 3","pages":"2173 - 2193"},"PeriodicalIF":4.4000,"publicationDate":"2025-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-025-06471-5.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Operations Research","FirstCategoryId":"91","ListUrlMain":"https://link.springer.com/article/10.1007/s10479-025-06471-5","RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
Scheduling problems on parallel dedicated machines with non-renewable resource
We study scheduling problems on parallel dedicated machines and assume that a specific job can only be processed on one specific machine. We concentrate on solving scheduling problems involving convex resource allocation and address three of the most fundamental measures in scheduling theory, i.e., makespan, total load, and total weighted completion time. Firstly, we focus on position-independent workloads, and then we study the setting of general position-dependent workloads, i.e., the workloads are not restricted to be either monotone functions of the job positions or any specific functions. In all problems, we assume a common continuous and non-renewable (limited) resource and adapt known results from scheduling theory to solve the considered problems.
期刊介绍：
The Annals of Operations Research publishes peer-reviewed original articles dealing with key aspects of operations research, including theory, practice, and computation. The journal publishes full-length research articles, short notes, expositions and surveys, reports on computational studies, and case studies that present new and innovative practical applications.
In addition to regular issues, the journal publishes periodic special volumes that focus on defined fields of operations research, ranging from the highly theoretical to the algorithmic and the applied. These volumes have one or more Guest Editors who are responsible for collecting the papers and overseeing the refereeing process.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
