haku: @author Christofides, N. / yhteensä: 5
viite: 2 / 5
| Tekijä: | Christofides, N. Alvarez-Valdes, R. Tamarit, J. M. |
| Otsikko: | Project scheduling with resource constraints : A branch and bound approach. |
| Lehti: | European Journal of Operational Research
1987 : JUN, VOL. 29:3, p. 262-273 |
| Asiasana: | SCHEDULING BRANCH AND BOUND METHODS PROJECTS INTEGER PROGRAMMING |
| Kieli: | eng |
| Tiivistelmä: | A branch and bound algorithm is developed. To reduce the three search four lower bounds are embedded. The first is based only on the precedence constraints. The second uses the linear relaxation of an integer programming formulation of the problem, improved by the introduction of cutting planes. The third is based on Lagrangean relaxation and the fourth on the idea of using disjunctive arcs to partly describe constraints involving the unscheduled activities at a certain node. It is concluded that for problems with loose resource constraints bounds based on longest path computations seem to be good enough. |
SCIMA