The discrete time-cost tradeoff problem revisited
暂无分享,去创建一个
Prabuddha De | Jay B. Ghosh | Charles E. Wells | E. James Dunne | P. De | J. B. Ghosh | C. E. Wells | E. Dunne
[1] Prabuddha De,et al. Heuristic Estimation of the Efficient Frontier for a Bi‐Criteria Scheduling Problem , 1992 .
[2] Louis R. Shaffer,et al. Extending CPM for Multiform Project Time - Cost Curves , 1965 .
[3] Wallace B. S. Crowston,et al. Decision CPM: A Method for Simultaneous Planning, Scheduling, and Control of Projects , 1967, Oper. Res..
[4] S. Elmaghraby. Resource allocation via dynamic programming in activity networks , 1993 .
[5] Marshall L. Fisher,et al. An Applications Oriented Guide to Lagrangian Relaxation , 1985 .
[6] Richard L. Shell,et al. Time Based Manufacturing , 1993 .
[7] Rolf H. Möhring,et al. A Fast Algorithm for the Decomposition of Graphs and Posets , 1983, Math. Oper. Res..
[8] William S. Butcher. Dynamic Programming for Project Cost-Time Curves , 1967 .
[9] L. Valadares Tavares. A multi-stage non-deterministic model for project scheduling under resources constraints , 1990 .
[10] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[11] Jerzy Kamburowski,et al. Optimal Reductions of Two-Terminal Directed Acyclic Graphs , 1992, SIAM J. Comput..
[12] D. Panagiotakopoulos. A CPM Time-Cost Computational Algorithm for Arbitrary Activity Cost Functions , 1977 .
[13] James E. Kelley,et al. Critical-Path Planning and Scheduling: Mathematical Basis , 1961 .
[14] E. W. Davis,et al. Project Management With Cpm, Pert and Precedence Diagramming , 1983 .
[15] John F. Muth,et al. A Dynamic Programming Algorithm for Decision CPM Networks , 1979, Oper. Res..
[16] George Steiner,et al. Optimal Sequencing by Modular Decomposition: Polynomial Algorithms , 1986, Oper. Res..
[17] D. R. Fulkerson. A Network Flow Computation for Project Cost Curves , 1961 .
[18] D. R. Robinson. A Dynamic Programming Solution to Cost-Time Tradeoff for CPM , 1975 .
[19] Salah E. Elmaghraby,et al. Activity networks: Project planning and control by network models , 1977 .
[20] Pei-Chann Chang,et al. One-machine rescheduling heuristics with efficiency and stability as criteria , 1993, Comput. Oper. Res..
[21] Jeremy P. Spinrad,et al. Incremental modular decomposition , 1989, JACM.
[22] Eugene L. Lawler,et al. The Recognition of Series Parallel Digraphs , 1982, SIAM J. Comput..
[23] William S. Jewell,et al. Decomposition of Project Networks , 1965 .
[24] Joseph D. Blackburn,et al. Time-based competition : the next battleground in American manufacturing , 1991 .