-
1
-
-
0017921368
-
Finding an optimal sequence by dynamic programming: An extension to precedence-related tasks
-
K.R. Baker and L.E. Schrage, "Finding an optimal sequence by dynamic programming: an extension to precedence-related tasks", Oper. Res. 26, 111-120 (1978).
-
(1978)
Oper. Res.
, vol.26
, pp. 111-120
-
-
Baker, K.R.1
Schrage, L.E.2
-
2
-
-
0026836953
-
A branch and bound algorithm to minimize total tardiness with different release times
-
C. Chu, "A branch and bound algorithm to minimize total tardiness with different release times", Naval Res. Logist. 39, 265-283 (1992).
-
(1992)
Naval Res. Logist.
, vol.39
, pp. 265-283
-
-
Chu, C.1
-
3
-
-
0000474126
-
Minimizing total tardiness on one processor is NP-hard
-
J. Du and J.Y.-T. Leung, "Minimizing total tardiness on one processor is NP-hard", Math. Oper. Res. 15, 483-495 (1990).
-
(1990)
Math. Oper. Res.
, vol.15
, pp. 483-495
-
-
Du, J.1
Leung, J.Y.-T.2
-
4
-
-
0014535952
-
One-machine sequencing to minimize certain functions of job tardiness
-
H. Emmons, "One-machine sequencing to minimize certain functions of job tardiness", Oper. Res. 17, 701-715 (1969).
-
(1969)
Oper. Res.
, vol.17
, pp. 701-715
-
-
Emmons, H.1
-
5
-
-
0017240964
-
A dual algorithm for the one-machine scheduling problem
-
M.L. Fischer, "A dual algorithm for the one-machine scheduling problem", Math. Programming 11, 229-251 (1976).
-
(1976)
Math. Programming
, vol.11
, pp. 229-251
-
-
Fischer, M.L.1
-
6
-
-
77957077792
-
A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness
-
E.L. Lawler, "A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness", Ann. Discrete Math. 1, 331-342 (1977).
-
(1977)
Ann. Discrete Math.
, vol.1
, pp. 331-342
-
-
Lawler, E.L.1
-
7
-
-
0020205577
-
A decomposition algorithm for the single machine total tardiness problem
-
C.N. Potts and L.N. Van Wassenhove, "A decomposition algorithm for the single machine total tardiness problem", Oper. Res. Lett. 1, 177-181 (1982).
-
(1982)
Oper. Res. Lett.
, vol.1
, pp. 177-181
-
-
Potts, C.N.1
Van Wassenhove, L.N.2
-
8
-
-
0023565502
-
Dynamic programming and decomposition approaches for single machine total tardiness problem
-
C.N. Potts and L.N. Van Wassenhove, "Dynamic programming and decomposition approaches for single machine total tardiness problem", European J. Oper. Res. 32, 405-414 (1987).
-
(1987)
European J. Oper. Res.
, vol.32
, pp. 405-414
-
-
Potts, C.N.1
Van Wassenhove, L.N.2
-
10
-
-
0017972181
-
Dynamic programming solution of sequencing problems with precedence constraints
-
L. Schrage and K.R. Baker, "Dynamic programming solution of sequencing problems with precedence constraints", Oper. Res. 26, 444-449 (1978).
-
(1978)
Oper. Res.
, vol.26
, pp. 444-449
-
-
Schrage, L.1
Baker, K.R.2
-
11
-
-
0000845408
-
A hybrid algorithm for the one-machine sequencing problem to minimize total tardiness
-
V. Srinivasan, "A hybrid algorithm for the one-machine sequencing problem to minimize total tardiness", Naval Res. Logist. Quart. 18, 317-327 (1971).
-
(1971)
Naval Res. Logist. Quart.
, vol.18
, pp. 317-327
-
-
Srinivasan, V.1
|