SOLVABLE CASE OF ONE-MACHINE SCHEDULING PROBLEM WITH READY AND DUE TIMES

被引：84

作者：

KISE, H ^{[1
]}

IBARAKI, T ^{[1
]}

MINE, H ^{[1
]}

机构：

[1] KYOTO UNIV,KYOTO 606,JAPAN

来源：

OPERATIONS RESEARCH | 1978年 / 26卷 / 01期

关键词：

D O I：

10.1287/opre.26.1.121

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

Consideration of a class of n-job one-machine scheduling problems with ready time r(i), processing time p(i), and due time d(i) for each job i. Preemption is not allowed, and precedence constraints among jobs are not assumed. For this problem the authors show that there is a 0(n**2)-time algorithm to find a schedule that minimizes the number of tardy jobs, under the assumption that r(i) less than r(j) implies d(i) less than or equal to d(j).

引用

页码：121 / 126

页数：6

共 50 条

[1] PERFORMANCE ANALYSIS OF 6 APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES
KISE, H
IBARAKI, T
MINE, H
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1979, 22 (03) : 205 - 224
[2] A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates
Sevaux M.
Sörensen K.
Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 2004, 2 (2) : 129 - 147
[3] MINIMIZATION OF COSTS ASSOCIATED WITH VARIABLE DUE TIMES IN ONE-MACHINE SCHEDULING THEORY
GORDON, VS
AUTOMATION AND REMOTE CONTROL, 1992, 53 (02) : 239 - 244
[4] DUAL ALGORITHM FOR ONE-MACHINE SCHEDULING PROBLEM
FISHER, ML
MATHEMATICAL PROGRAMMING, 1976, 11 (03) : 229 - 251
[5] One-machine, N-product-type, continuous-time scheduling with a common due date:: a polynomially solvable case
Kogan, K
IIE TRANSACTIONS, 2001, 33 (01) : 1 - 10
[6] One-machine, N-product-type, continuous-time scheduling with a common due date: A polynomially solvable case
Kogan, Konstantin
IIE Transactions (Institute of Industrial Engineers), 2001, 33 (01): : 1 - 10
[7] ONE-MACHINE SCHEDULING WITH SETUP TIMES - FAST SOLUTIONS AND APPLICATIONS
CONSTANTOPOULOS, P
GEORGIOU, T
TSATSAKIS, N
IFIP TRANSACTIONS B-APPLICATIONS IN TECHNOLOGY, 1993, 13 : 185 - 192
[8] Search heuristics for a parallel machine scheduling problem with ready times and due dates
Park, MW
Kim, YD
COMPUTERS & INDUSTRIAL ENGINEERING, 1997, 33 (3-4) : 793 - 796
[9] A LOCALLY OPTIMAL INSERTION HEURISTIC FOR A ONE-MACHINE SCHEDULING PROBLEM
WERNER, F
RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1990, 24 (03): : 255 - 262
[10] The one-machine just-in-time scheduling problem with preemption
Hendel, Yann
Runge, Nina
Sourd, Francis
DISCRETE OPTIMIZATION, 2009, 6 (01) : 10 - 22

← 1 2 3 4 5 →