Resource-constrained project scheduling: from a lagrangian relaxation to competitive solutions
暂无分享,去创建一个
[1] Sönke Hartmann,et al. Self-adapting genetic algorithms with an application to project scheduling , 1999 .
[2] David B. Shmoys,et al. Scheduling to minimize average completion time: off-line and on-line algorithms , 1996, SODA '96.
[3] Cynthia A. Phillips,et al. Minimizing average completion time in the presence of release dates , 1998, Math. Program..
[4] Rainer Kolisch,et al. PSPLIB - a project scheduling problem library , 1996 .
[5] Rolf H. Möhring,et al. Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..
[6] J. M. Tamarit,et al. Project scheduling with resource constraints: A branch and bound approach , 1987 .
[7] Alexander Schwartz,et al. Implementing weighted b-matching algorithms: towards a flexible software design , 1999, JEAL.
[8] onke Hartmann. Self-Adapting Genetic Algorithms with anApplication to Project , 1999 .
[9] R. Kolisch,et al. Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis , 1999 .
[10] Michel X. Goemans,et al. Improved approximation algorthims for scheduling with release dates , 1997, SODA '97.
[11] Rainer Kolisch,et al. PSPLIB - A project scheduling problem library: OR Software - ORSEP Operations Research Software Exchange Program , 1997 .
[12] Rolf H. Möhring,et al. Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems , 1999, ESA.