haku: @indexterm LINEAR PROGRAMMING / yhteensä: 544
viite: 9 / 544
| Tekijä: | Möhring, R.H. (et al.) |
| Otsikko: | Solving project scheduling problems by minimum cut computations |
| Lehti: | Management Science
2003 : MAR, VOL. 49:3, p. 330-350 |
| Asiasana: | Linear programming Problem solving Project management Scheduling |
| Kieli: | eng |
| Tiivistelmä: | In project scheduling, a set of precedence-constrained jobs has to be scheduled so as to minimize a given objective. In resource-constrained project scheduling, the jobs additionally compete for scarce resources. Due to its universality, the latter problem has a variety of applications in manufacturing, production planning, project management, and elsewhere. It is one of the most intractable problems in operations research, and has therefore become a popular playground for the latest optimization techniques, including virtually all local search paradigms. The authors show that a somewhat more classical mathematical programming approach leads to both competitive feasible solutions and strong lower bounds, within reasonable computation times. |
SCIMA