One machine scheduling to minimize the maximum earliness with minimum number of tardy jobs

被引：13

作者：

Guner, E ^{[1
]}

Erol, S ^{[1
]}

Tani, K ^{[1
]}

机构：

[1] Gazi Univ, Dept Ind Engn, TR-06570 Ankara, Turkey

来源：

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS | 1998年 / 55卷 / 02期

关键词：

production scheduling; one machine scheduling; secondary-criterion; multiple criteria optimization; branch and bound algorithm;

D O I：

10.1016/S0925-5273(98)00062-0

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

In this study we consider the problem of sequencing n jobs on one machine under the dual objective of minimizing the maximum earliness (E-max) with minimum number of tardy jobs (n(T)). A procedure is first proposed to schedule for minimizing the maximum earliness when the set of non-tardy jobs is specified. A branch and bound algorithm is presented to obtain the optimal schedule that minimizes the maximum earliness with minimum number of tardy jobs by connecting Moore's algorithm. (C) 1998 Elsevier Science B.V. All rights reserved.

引用

页码：213 / 219

页数：7

共 50 条

[1] 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
[2] SCHEDULING N JOBS ON ONE MACHINE TO MINIMIZE THE MAXIMUM TARDINESS WITH MINIMUM NUMBER TARDY
SHANTHIKUMAR, JG
[J]. COMPUTERS & OPERATIONS RESEARCH, 1983, 10 (03) : 255 - 266
[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] 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
[6] Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
Azizoglu, M
Koksalan, M
Koksalan, SK
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2003, 54 (06) : 661 - 664
[7] 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
[8] Single‐machine scheduling to minimize maximumtardiness with minimum number of tardy jobs
J.N.D. Gupta
A.M.A. Hariri
C.N. Potts
[J]. Annals of Operations Research, 1999, 92 : 107 - 123
[9] 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
[10] 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

← 1 2 3 4 5 →