The minmax due-date assignment problem with acceptable lead-times

IF 4.4 3区管理学 Q1 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

Annals of Operations Research Pub Date : 2024-10-04 DOI:10.1007/s10479-024-06290-0

Gur Mosheiov, Assaf Sarig

引用次数: 0

Abstract

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.

查看原文本刊更多论文

具有可接受交货期的最大最小交货期分配问题

研究了具有可接受交货期的单机调度和交货期分配问题。该设置结合了经典公共截止日期模型和DIF模型的元素，其中需要确定与工作相关的截止日期。目标函数为最小最大类型，由四个成本组成：(1)作业提前成本，(2)作业延迟成本，(3)到期日成本，(4)到期日延迟成本。我们提出了一个简单的程序来识别不同的作业类型，因此，一个多项式时间的解决方案被引入。还讨论了可接受的交货期的适当窗口的情况。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Annals of Operations Research 管理科学-运筹学与管理科学

CiteScore

7.90

自引率

16.70%

发文量

596

审稿时长

8.4 months

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