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 条

[21] Scheduling an unbounded batch machine to minimize maximum lateness
Bai, Shuyan
Zhang, Fuzeng
Li, Shuguang
Liu, Qiming
FRONTIERS IN ALGORITHMICS, PROCEEDINGS, 2007, 4613 : 172 - +
[22] A heuristic for scheduling general job shops to minimize maximum lateness
Su, LH
Chang, PC
Lee, ES
MATHEMATICAL AND COMPUTER MODELLING, 1998, 27 (01) : 1 - 15
[23] SCHEDULING WITH READY TIMES AND DUE DATES TO MINIMIZE MAXIMUM LATENESS
MCMAHON, G
FLORIAN, M
OPERATIONS RESEARCH, 1975, 23 (03) : 475 - 482
[24] Minimizing maximum lateness in a single machine scheduling problem with fuzzy processing times and fuzzy due dates
Chanas, S
Kasperski, A
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2001, 14 (03) : 377 - 386
[25] Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
He, Cheng
Lin, Yixun
Yuan, Jinjiang
THEORETICAL COMPUTER SCIENCE, 2007, 381 (1-3) : 234 - 240
[26] Single machine scheduling with sequence-dependent family setups to minimize maximum lateness
Jin, F.
Gupta, J. N. D.
Song, S.
Wu, C.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2010, 61 (07) : 1181 - 1189
[27] Single machine scheduling to minimize the maximum lateness with both specific and generalized due dates
Tanaka, K
Vlach, M
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1997, E80A (03) : 557 - 563
[28] Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints
Liu, Zhixin
COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (09) : 1537 - 1543
[29] Minimizing the maximum lateness for scheduling with release times and job rejection
Kacem, Imed
Kellerer, Hans
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 48 (03)
[30] Batch scheduling to minimize maximum lateness
Ghosh, JB
Gupta, JND
OPERATIONS RESEARCH LETTERS, 1997, 21 (02) : 77 - 80

← 1 2 3 4 5 →