-
1
-
-
0033114757
-
A review of scheduling research involving setup considerations
-
Allahverdi, A., Gupta, J.N.D. and Aldowaisan, T., A review of scheduling research involving setup considerations. OMEGA, 1999, 27, 219-239.
-
(1999)
OMEGA
, vol.27
, pp. 219-239
-
-
Allahverdi, A.1
Gupta, J.N.D.2
Aldowaisan, T.3
-
2
-
-
0000474126
-
Minimizing total tardiness on one machine is NP-hard
-
Du, J. and Leung, J.Y.T., Minimizing total tardiness on one machine is NP-hard. Math. Oper. Res., 1990, 15, 483-495.
-
(1990)
Math. Oper. Res
, vol.15
, pp. 483-495
-
-
Du, J.1
Leung, J.Y.T.2
-
3
-
-
0001627504
-
Complexity results for multiprocessor scheduling under resource constraints
-
Garey, M.R. and Johnson, D.S., Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput., 1975, 4, 397-411.
-
(1975)
SIAM J. Comput
, vol.4
, pp. 397-411
-
-
Garey, M.R.1
Johnson, D.S.2
-
4
-
-
0026626727
-
A heuristic algorithm for sequencing on one machine to minimize total tardiness
-
Holsenback, J.E. and Russell, R.M., A heuristic algorithm for sequencing on one machine to minimize total tardiness. J. Oper. Res. Soc., 1992, 43, 53-62.
-
(1992)
J. Oper. Res. Soc
, vol.43
, pp. 53-62
-
-
Holsenback, J.E.1
Russell, R.M.2
-
5
-
-
26444479778
-
Optimization by simulated annealing
-
4598
-
Kirkpatrick, S., Gelatt, C. and Vecchi, M., Optimization by simulated annealing. Science, 1983, 20/4598, 671-680.
-
(1983)
Science
, vol.20
, pp. 671-680
-
-
Kirkpatrick, S.1
Gelatt, C.2
Vecchi, M.3
-
6
-
-
0031235385
-
Scheduling family of jobs with setup times
-
Liaee, M.M. and Emmons, H., Scheduling family of jobs with setup times. Int. J. Prod. Econ., 1997, 51, 165-177.
-
(1997)
Int. J. Prod. Econ
, vol.51
, pp. 165-177
-
-
Liaee, M.M.1
Emmons, H.2
-
7
-
-
0024736520
-
On the complexity of scheduling with batch setups
-
Monma, C.L. and Potts, C.N., On the complexity of scheduling with batch setups. Oper. Res., 1989, 37, 798-804.
-
(1989)
Oper. Res
, vol.37
, pp. 798-804
-
-
Monma, C.L.1
Potts, C.N.2
-
8
-
-
0027906584
-
A heuristic for the single machine tardiness problem
-
Panwalkar, S.S., Smith, M.L. and Koulamas, C.P., A heuristic for the single machine tardiness problem. Eur. J. Oper. Res., 1993, 70, 304-310.
-
(1993)
Eur. J. Oper. Res
, vol.70
, pp. 304-310
-
-
Panwalkar, S.S.1
Smith, M.L.2
Koulamas, C.P.3
-
9
-
-
0033895628
-
Scheduling with batching: A review
-
Potts, C.N. and Kovalyov, M.Y., Scheduling with batching: a review. Eur. J. Oper. Res., 2000, 120, 228-249.
-
(2000)
Eur. J. Oper. Res
, vol.120
, pp. 228-249
-
-
Potts, C.N.1
Kovalyov, M.Y.2
-
10
-
-
84974861854
-
Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity
-
Potts, C.N. and van Wassenhove, L.N., Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. J. Oper. Res. Soc., 1992, 43, 395-406.
-
(1992)
J. Oper. Res. Soc
, vol.43
, pp. 395-406
-
-
Potts, C.N.1
van Wassenhove, L.N.2
-
11
-
-
0031076032
-
Evaluation of leading heuristics for the single machine tardiness problem
-
Russell, R.M. and Holsenback, J.E., Evaluation of leading heuristics for the single machine tardiness problem. Eur. J. Oper. Res., 1997, 96, 538-545.
-
(1997)
Eur. J. Oper. Res
, vol.96
, pp. 538-545
-
-
Russell, R.M.1
Holsenback, J.E.2
-
12
-
-
0029338650
-
Scheduling groups of jobs on a single machine
-
Webster, S. and Baker, K.R., Scheduling groups of jobs on a single machine. Oper. Res., 1995, 43, 692-703.
-
(1995)
Oper. Res
, vol.43
, pp. 692-703
-
-
Webster, S.1
Baker, K.R.2
|