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

被引：1
|
作者：
Mosheiov, Gur [1 ,2 ,4 ]
Sarig, Assaf [1 ,2 ,3 ]
机构：
[1] Hebrew Univ Jerusalem, Sch Business Adm, Jerusalem, Israel
[2] Hebrew Univ Jerusalem, Dept Stat, Jerusalem, Israel
[3] Coll Law & Business, Ramat Gan, Israel
[4] Jerusalem Coll Technol, Lev Acad Ctr, Jerusalem, Israel
来源：
ANNALS OF OPERATIONS RESEARCH | 2024年 / 343卷 / 01期
关键词：
Scheduling; Single machine; Due-date assignment; Earliness-tardiness; Acceptable lead-time; WINDOW;
D O I：
10.1007/s10479-024-06290-0
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
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.
引用
收藏
页码：401 / 410
页数：10
相关论文
共 50 条
12345