Single machine scheduling to minimize the absolute maximum lateness with shortening job processing times

被引：0

作者：

Huang, Xue ^{[1
]}

机构：

[1] Shenyang Aerosp Univ, Sch Sci, Shenyang 110136, Liaoning, Peoples R China

来源：

JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES | 2012年 / 33卷 / 06期

基金：

中国国家自然科学基金;

关键词：

Scheduling; Single machine; Time-dependent processing time; Absolute maximum lateness;

D O I：

暂无

中图分类号：

G25 [图书馆学、图书馆事业]; G35 [情报学、情报工作];

学科分类号：

1205 ; 120501 ;

摘要：

In this paper we consider a single machine scheduling problem with shortening job processing times. The objective is to find a schedule that minimizes the absolute maximum lateness, where the due dates of jobs are a common due date for all jobs. For the cases of common due date is a given constant and a variable, we show that the problem can be solved in polynomial time, respectively.

引用

页码：645 / 651

页数：7

共 50 条

[41] Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
Ali Allahverdi
Muberra Allahverdi
Computational and Applied Mathematics, 2018, 37 : 6774 - 6794
[42] Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
Yuan, J. J.
Ng, C. T.
Cheng, T. C. E.
JOURNAL OF SCHEDULING, 2015, 18 (02) : 147 - 153
[43] Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection
Atsmony, Matan
Mosheiov, Gur
OPTIMIZATION LETTERS, 2024, 18 (03) : 751 - 766
[44] Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection
Matan Atsmony
Gur Mosheiov
Optimization Letters, 2024, 18 : 751 - 766
[45] Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
Allahverdi, A
COMPUTERS & OPERATIONS RESEARCH, 1996, 23 (10) : 909 - 916
[46] Scheduling A Single Machine With Job Family Setup Times To Minimize Total Tardiness
Abdallah, Khaled S.
Jang, Jaejin
2017 INTERNATIONAL CONFERENCE ON ENGINEERING, TECHNOLOGY AND INNOVATION (ICE/ITMC), 2017, : 665 - 672
[47] Scheduling to minimize the maximum lateness with multiple product-classes in batch processing
Wang, SF
Zou, YR
2002 IEEE REGION 10 CONFERENCE ON COMPUTERS, COMMUNICATIONS, CONTROL AND POWER ENGINEERING, VOLS I-III, PROCEEDINGS, 2002, : 1595 - 1598
[48] Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
J. J. Yuan
C. T. Ng
T. C. E. Cheng
Journal of Scheduling, 2015, 18 : 147 - 153
[49] Single-machine scheduling with decreasing time-dependent processing times to minimize total absolute differences in waiting times
Wang, Dan
Wu, Yu-Bin
Wang, Ji-Bo
Ji, Ping
JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING, 2012, 29 (07) : 444 - 453
[50] Minimizing maximum absolute lateness and range of lateness under generalizeddue dates on a single machine
K. Tanaka
M. Vlach
Annals of Operations Research, 1999, 86 : 507 - 526

← 1 2 3 4 5 →