Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed

被引：9

作者：

Azizoglu, M

Koksalan, M ^{[1
]}

Koksalan, SK

机构：

[1] Middle E Tech Univ, TR-06531 Ankara, Turkey

[2] Purdue Univ, W Lafayette, IN 47907 USA

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 2003年 / 54卷 / 06期

关键词：

bicriteria scheduling; maximum earliness; number of tardy jobs;

D O I：

10.1057/palgrave.jors.2601478

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

We address the bicriteria problem of minimizing the number of tardy jobs and maximum earliness on a single machine where machine idle time is allowed. We show that the problem of minimizing the number of tardy jobs while maximum earliness is kept at its minimum value of zero is polynomially solvable. We present polynomial time algorithms for the maximum earliness problem subject to no tardy jobs and the maximum earliness problem for a given set of tardy jobs. Finally, we discuss the use of the latter algorithm in generating all efficient schedules.

引用

页码：661 / 664

页数：4

共 50 条

[1] Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
Azizoglu, M
Köksalan, M
Kondak, S
[J]. RESEARCH AND PRACTICE IN MULTIPLE CRITERIA DECISION MAKING, 2000, 487 : 381 - 387
[2] One machine scheduling to minimize the maximum earliness with minimum number of tardy jobs
Guner, E
Erol, S
Tani, K
[J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1998, 55 (02) : 213 - 219
[3] SINGLE-MACHINE SCHEDULING TO MINIMIZE EARLINESS AND NUMBER OF TARDY JOBS
CHENG, TCE
KAHLBACHER, HG
[J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1993, 77 (03) : 563 - 573
[4] PARALLEL MACHINE SCHEDULING TO MINIMIZE COSTS FOR EARLINESS AND NUMBER OF TARDY JOBS
KAHLBACHER, HG
CHENG, TCE
[J]. DISCRETE APPLIED MATHEMATICS, 1993, 47 (02) : 139 - 164
[5] Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
Molaee, Ehsan
Moslehi, Ghasem
Reisi, Mohammad
[J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2010, 60 (11) : 2909 - 2919
[6] Single machine scheduling with maximum earliness and number tardy
Azizoglu, M
Kondakci, S
Köksalan, M
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2003, 45 (02) : 257 - 268
[7] Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
Wan, Guohua
Yen, Benjamin P. -C.
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 195 (01) : 89 - 97
[8] Scheduling n jobs on one machine to minimize the maximum lateness with a minimum number of tardy jobs
Chang, PC
Su, LH
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2001, 40 (04) : 349 - 360
[9] Identical machine scheduling to minimize the number of tardy jobs when lot-splitting is allowed
Suer, GA
Pico, F
Santiago, A
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 1997, 33 (1-2) : 277 - 280
[10] Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
Gupta, JND
Hariri, AMA
Potts, CN
[J]. ANNALS OF OPERATIONS RESEARCH, 1999, 92 (0) : 107 - 123

← 1 2 3 4 5 →