A RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM WITH REATTEMPT AT FAILURE : A HEURISTIC APPROACH
暂无分享,去创建一个
[1] Erik Demeulemeester,et al. A Random Activity Network Generator , 1993, Oper. Res..
[2] Edward W. Davis,et al. An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints , 1971 .
[3] Andreas Drexl,et al. Scheduling of Project Networks by Job Assignment , 1991 .
[4] Andreas Drexl,et al. Nonpreemptive multi-mode resource-constrained project scheduling , 1993 .
[5] Roman Słowiński,et al. Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems , 1990 .
[6] F. Brian Talbot,et al. Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case , 1982 .
[7] E. W. Davis,et al. Multiple Resource–Constrained Scheduling Using Branch and Bound , 1978 .
[8] James H. Patterson,et al. An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems , 1978 .
[9] J. M. Tamarit,et al. Project scheduling with resource constraints: A branch and bound approach , 1987 .
[10] Arno Sprecher,et al. Resource-Constrained Project Scheduling: Exact Methods for the Multi-Mode Case , 1994 .
[11] Elsayed A. Elsayed,et al. Heuristics for resource-constrained scheduling† , 1986 .
[12] R. Deal. Simulation Modeling and Analysis (2nd Ed.) , 1994 .
[13] Averill M. Law,et al. Simulation Modeling and Analysis , 1982 .
[14] Erik Demeulemeester,et al. A branch-and-bound procedure for the multiple resource-constrained project scheduling problem , 1992 .