-
1
-
-
0000711418
-
A branch and bound solution to the general scheduling problem
-
Greenberg, H.H., "A branch and bound solution to the general scheduling problem", Operations Research, Vol. 16, 1968, pp. 353-61.
-
(1968)
Operations Research
, vol.16
, pp. 353-61
-
-
Greenberg, H.H.1
-
2
-
-
0000177367
-
Application of the branch and bound technique to some flow- shop scheduling problems
-
Ignall, E. and Schrage, L., "Application of the branch and bound technique to some flow- shop scheduling problems", Operations Research, Vol. 13, 1965, pp. 400-12.
-
(1965)
Operations Research
, vol.13
, pp. 400-12
-
-
Ignall, E.1
Schrage, L.2
-
3
-
-
0040970477
-
Branch and bound algorithm for the exact solution of the three machine scheduling problem
-
Lomnicki, Z.A., "Branch and bound algorithm for the exact solution of the three machine scheduling problem", Operational Research Quarterly, Vol. 16, 1965, pp. 89-100.
-
(1965)
Operational Research Quarterly
, vol.16
, pp. 89-100
-
-
Lomnicki, Z.A.1
-
4
-
-
0040376243
-
Approximate solution to the three-machine scheduling problem
-
Giglio, R.J. and Wagner, H.M., "Approximate solution to the three-machine scheduling problem", Operations Research, Vol. 12, 1964, pp. 305-24.
-
(1964)
Operations Research
, vol.12
, pp. 305-24
-
-
Giglio, R.J.1
Wagner, H.M.2
-
5
-
-
0038709760
-
The schedule-sequencing problem
-
Bowan, E.H., "The schedule-sequencing problem", Operations Research, Vol. 7, 1959, pp. 621-4.
-
(1959)
Operations Research
, vol.7
, pp. 621-4
-
-
Bowan, E.H.1
-
8
-
-
0015361193
-
An algorithm for project (job) sequencing with resource constraints
-
Gorenstein, S., "An algorithm for project (job) sequencing with resource constraints", Operations Research, Vol. 20 No. 4, 1972, pp. 835-50.
-
(1972)
Operations Research
, vol.20
, Issue.4
, pp. 835-50
-
-
Gorenstein, S.1
-
9
-
-
0002381223
-
Machine sequencing via disjunctive graph: An implicit enumeration algorithm
-
Balas, E., "Machine sequencing via disjunctive graph: an implicit enumeration algorithm", Operations Research, Vol. 17, 1969, pp. 941-57.
-
(1969)
Operations Research
, vol.17
, pp. 941-57
-
-
Balas, E.1
-
10
-
-
3543055574
-
Minimaximal paths in disjunctive graph by direct search
-
Raimond, J.F., "Minimaximal paths in disjunctive graph by direct search", IMB Journal of Research and Development, Vol. 13, 1969, pp. 391-9.
-
(1969)
IMB Journal of Research and Development
, vol.13
, pp. 391-9
-
-
Raimond, J.F.1
-
11
-
-
0003075019
-
Optimal two- and three-stage production schedules with set-up times included
-
Johnson, S., "Optimal two- and three-stage production schedules with set-up times included", Naval Research Logistics Quarterly, Vol. 1, 1954, pp. 61-8.
-
(1954)
Naval Research Logistics Quarterly
, vol.1
, pp. 61-8
-
-
Johnson, S.1
-
13
-
-
0014807274
-
A heuristic algorithm for N jobs, M machine sequencing problem
-
Campbell, H.G., Smith, M.L. and Dudek, R.A., "A heuristic algorithm for N jobs, M machine sequencing problem", Management Science, Vol. 16 No. 10, June 1970, pp. B630-B637.
-
(1970)
Management Science
, vol.16
, Issue.10
-
-
Campbell, H.G.1
Smith, M.L.2
Dudek, R.A.3
|