A comparison of stochastic scheduling rules for maximizing project net present value
From MaRDI portal
Publication:1127130
DOI10.1016/0377-2217(94)00039-FzbMath0912.90184OpenAlexW2069246925WikidataQ127081391 ScholiaQ127081391MaRDI QIDQ1127130
Lee Choo Tay, Chee Chuong Sum, Kum Khiong Yang
Publication date: 13 August 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)00039-f
Related Items (11)
Which fuzzy ranking method is best for maximizing fuzzy net present value? ⋮ Metaheuristics: A bibliography ⋮ Order-based neighborhoods for project scheduling with nonregular objective functions. ⋮ Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models ⋮ Resource-constrained project scheduling: Notation, classification, models, and methods ⋮ Progress payments in project scheduling problems. ⋮ An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations ⋮ Project network models with discounted cash flows a guided tour through recent developments ⋮ An integer linear programming model and a modified branch and bound algorithm for the project material requirements planning problem ⋮ Simulated annealing and tabu search for multi-mode project payment scheduling ⋮ Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints
Cites Work
- Optimization by Simulated Annealing
- Project bidding under deterministic and probabilistic activity durations
- Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems
- New approaches for heuristic search: A bilateral linkage with artificial intelligence
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- Future paths for integer programming and links to artificial intelligence
- Scheduling a project to maximize its net present value: An integer programming approach
- Early-tardy cost trade-offs in resource constrained projects with cash flows: An optimization-guided heuristic approach
- Multi-Project Scheduling: Categorization of Heuristic Rules Performance
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach
- An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
- Heuristic scheduling of resource-constrained projects with cash flows
- Equation of State Calculations by Fast Computing Machines
- Cash Flows in Networks
- The payment scheduling problem
This page was built for publication: A comparison of stochastic scheduling rules for maximizing project net present value
