{"title":"具有可接受交货期的最大最小交货期分配问题","authors":"Gur Mosheiov, Assaf Sarig","doi":"10.1007/s10479-024-06290-0","DOIUrl":null,"url":null,"abstract":"<div><p>We study a single machine scheduling and due-date assignment problem with acceptable lead-times. The setting combines elements of the classical common due-date model and the DIF model, where job-dependent due-dates need to be determined. The objective function, which is of a minmax type, consists of four cost components: (1) job-earliness cost, (2) job-tardiness cost, (3) due-date cost, (4) due-date tardiness cost. We present a simple procedure for identifying the different job-types, and consequently, a polynomial-time solution is introduced. The case of due-windows for acceptable lead-times is also discussed.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"343 1","pages":"401 - 410"},"PeriodicalIF":4.4000,"publicationDate":"2024-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The minmax due-date assignment problem with acceptable lead-times\",\"authors\":\"Gur Mosheiov, Assaf Sarig\",\"doi\":\"10.1007/s10479-024-06290-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We study a single machine scheduling and due-date assignment problem with acceptable lead-times. The setting combines elements of the classical common due-date model and the DIF model, where job-dependent due-dates need to be determined. The objective function, which is of a minmax type, consists of four cost components: (1) job-earliness cost, (2) job-tardiness cost, (3) due-date cost, (4) due-date tardiness cost. We present a simple procedure for identifying the different job-types, and consequently, a polynomial-time solution is introduced. The case of due-windows for acceptable lead-times is also discussed.</p></div>\",\"PeriodicalId\":8215,\"journal\":{\"name\":\"Annals of Operations Research\",\"volume\":\"343 1\",\"pages\":\"401 - 410\"},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2024-10-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annals of Operations Research\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s10479-024-06290-0\",\"RegionNum\":3,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Operations Research","FirstCategoryId":"91","ListUrlMain":"https://link.springer.com/article/10.1007/s10479-024-06290-0","RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
The minmax due-date assignment problem with acceptable lead-times
We study a single machine scheduling and due-date assignment problem with acceptable lead-times. The setting combines elements of the classical common due-date model and the DIF model, where job-dependent due-dates need to be determined. The objective function, which is of a minmax type, consists of four cost components: (1) job-earliness cost, (2) job-tardiness cost, (3) due-date cost, (4) due-date tardiness cost. We present a simple procedure for identifying the different job-types, and consequently, a polynomial-time solution is introduced. The case of due-windows for acceptable lead-times is also discussed.
期刊介绍：
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号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
