-
1
-
-
0019702937
-
Minimizing the average deviation of job completion times about a common due date
-
Kanet, J.J. (1981) Minimizing the average deviation of job completion times about a common due date. Naval Research Logistics Quarterly, 28, 643-651.
-
(1981)
Naval Research Logistics Quarterly
, vol.28
, pp. 643-651
-
-
Kanet, J.J.1
-
2
-
-
0022714365
-
Minimizing mean absolute deviation of completion times about a common due date
-
Bagchi, U., Sullivan, R.S. and Chang, Y.L. (1986) Minimizing mean absolute deviation of completion times about a common due date. Naval Research Logistics Quarterly, 33, 227-240.
-
(1986)
Naval Research Logistics Quarterly
, vol.33
, pp. 227-240
-
-
Bagchi, U.1
Sullivan, R.S.2
Chang, Y.L.3
-
3
-
-
0020103079
-
A common due date assignment to minimize total penalty for the one machine scheduling prblem
-
Panwalkar, S.S., Smith, M.L. and Seidmann, A. (1982) A common due date assignment to minimize total penalty for the one machine scheduling prblem. Operations Research 30, 391-399.
-
(1982)
Operations Research
, vol.30
, pp. 391-399
-
-
Panwalkar, S.S.1
Smith, M.L.2
Seidmann, A.3
-
4
-
-
0021439811
-
Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
-
Sundararaghavan, P.S. and Ahmed, M.U. (1984) Minimizing the sum of absolute lateness in single-machine and multimachine scheduling. Naval Research Logistics Quarterly, 31, 325333.
-
(1984)
Naval Research Logistics Quarterly
, vol.31
, pp. 325333
-
-
Sundararaghavan, P.S.1
Ahmed, M.U.2
-
5
-
-
0002393136
-
Single and multiple processor models for minimizing completion variances
-
Hall, N.G. (1986) Single and multiple processor models for minimizing completion variances. Naval Research Logistics Quarterly, 33, 49-54.
-
(1986)
Naval Research Logistics Quarterly
, vol.33
, pp. 49-54
-
-
Hall, N.G.1
-
6
-
-
0023531467
-
Scheduling to a common due date on parallel uniform processors
-
Emmons, H. (1987) Scheduling to a common due date on parallel uniform processors Naval Research Logistics Quarterly, 34, 803-810.
-
(1987)
Naval Research Logistics Quarterly
, vol.34
, pp. 803-810
-
-
Emmons, H.1
-
7
-
-
84974859431
-
A heuristic for common due date assignment and job scheduling n parallel machines
-
Cheng, T.C.E. (1989) A heuristic for common due date assignment and job scheduling n parallel machines. Journal of the Operational Research Society, 40, 1129-1135.
-
(1989)
Journal of the Operational Research Society
, vol.40
, pp. 1129-1135
-
-
Cheng, T.C.E.1
-
8
-
-
0000845141
-
The parallel machine common due date assignment and scheduling problem is NP hard
-
Cheng, T.C.E. and Kahlbacher, H.G. (1992) The parallel machine common due date assignment and scheduling problem is NP hard. Asia Pacific Journal of Operational Research, 9, 235-238.
-
(1992)
Asia Pacific Journal of Operational Research
, vol.9
, pp. 235-238
-
-
Cheng, T.C.E.1
Kahlbacher, H.G.2
-
9
-
-
0026154209
-
On the multiple machine extension to a common due date assignment and scheduling problem
-
1991.
-
De, P., Ghosh, J.B. and Wells, C.E. (1991) On the multiple machine extension to a common due date assignment and scheduling problem. Journal of the Operational Research Society, 42, 419422, (1991).
-
(1991)
Journal of the Operational Research Society
, vol.42
, pp. 419422
-
-
De, P.1
Ghosh, J.B.2
Wells, C.E.3
-
10
-
-
0004113622
-
-
Addison Wesley, Reading MA.
-
Comvay, R.W., Maxwell, W.L. and Miller, LAV. (1967) Theory of Scheduling, Addison Wesley, Reading MA.
-
(1967)
Theory of Scheduling
-
-
Comvay, R.W.1
Maxwell, W.L.2
Miller, L.A.V.3
|