Discrete time/cost trade-offs in project scheduling with time-switch constraints

Journal of the Operational Research Society

Volumn 53, Issue 7, 2002, Pages 741-751

  Vanhoucke, M ^a   Demeulemeester, E ^b   Herroelen, W ^b  

^a VLERICK BUSINESS SCHOOL   (Belgium)

^b UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

CPM; Project management; Time switch constraints; Time cost trade off problem

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); CONSTRAINT THEORY; CRITICAL PATH ANALYSIS; HEURISTIC METHODS; OPTIMIZATION; SCHEDULING;

BRANCH AND BOUND ALGORITHM; PROJECT SCHEDULING; TIME-COST TRADE-OFF PROBLEM; TIME-SWITCH CONSTRAINTS;

PROJECT MANAGEMENT;

EID: 0036639255     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601351     Document Type: Article

References (36)

1. A classification scheme for project scheduling problems
2. A network flow computation for project cost curves
3. Critical path planning and scheduling: Mathematical basis
4. A simple CPM time/cost trade-off algorithm
5. A note on the paper: A simple CPM time/cost trade-off algorithm
6. Optimal linear approximation in project compression
7. Critical path problems with concave cost-time curves
8. Optimum time compression in project scheduling
9. An algorithm for the project cost/duration analysis problem with quadratic and convex cost functions
10. Reducing project duration at minimum cost: A time/cost trade-off algorithm
11. Optimal project compression under convex cost functions I: Quadratic cost with continuous derivative
12. Optimal project compression under convex cost functions II
13. Decision CPM: A method for simultaneous planning, scheduling and control of projects
14. Network reduction and solution
15. A dynamic programming solution to cost/time trade-off for CPM
16. Time-cost optimization
17. A dynamic programming algorithm for decision CPM networks
18. An implicit enumeration algorithm for the time/cost trade-off problem in project network analysis
19. Resource management in project scheduling
20. Multi-project scheduling with time-resource-cost trade-offs: A tactical model
21. The analysis of activity networks under generalized precedence relations
22. The discrete time/cost trade-off problem revisited
23. Complexity of the discrete time/cost trade-off problem for project networks
24. New computational results for the discrete time/cost trade-off problem in project networks
25. Optimal procedures for the discrete time/cost trade-off problem in project networks
26. Approximation algorithms for the discrete time-cost tradeoff problem
27. Network decomposition for the discrete time/cost trade-off problem - Part 1: Models and bounding methods
28. Network decomposition for the discrete time/cost trade-off problem - Part 2: Network decomposition and computational results
29. Finding the critical path in an activity network with time-switch constraints
30. A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
31. Characterization and generation of a general class of resource-constrained project scheduling problems
32. Optimal construction of project activity networks