Simulated annealing and tabu search for multi-mode project payment scheduling
From MaRDI portal
Publication:1042041
DOI10.1016/j.ejor.2008.10.005zbMath1176.90260OpenAlexW2043339087MaRDI QIDQ1042041
Tao Jia, Zhengwen He, Yu Xu, Nengmin Wang
Publication date: 7 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.10.005
Related Items (14)
The impact of solution representations on heuristic net present value optimization in discrete time/cost trade-off project scheduling with multiple cash flow and payment models ⋮ Multi-mode resource availability cost problem with recruitment and release dates for resources ⋮ A reduction tree approach for the discrete time/cost trade-off problem ⋮ Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap ⋮ A branch and bound algorithm for project scheduling problem with spatial resource constraints ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ Tabu search for dedicated resource-constrained multiproject scheduling to minimise the maximal cash flow gap under uncertainty ⋮ Multi-objective multi-mode resource constrained project scheduling problem using Pareto-based algorithms ⋮ Optimizing version release dates of research and development long-term processes ⋮ Capital- and resource-constrained project scheduling with net present value optimization ⋮ Resource constrained project scheduling subject to due dates: preemption permitted with penalty ⋮ Metaheuristics for multi-mode capital-constrained project payment scheduling ⋮ Temporary workforce planning with firm contracts: a model and a simulated annealing heuristic ⋮ Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The scheduling of activities to maximize the net present value of projects
- Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems
- On the discrete time, cost and quality trade-off problem
- A comparison of stochastic scheduling rules for maximizing project net present value
- The discrete time-cost tradeoff problem revisited
- Computational experience with an optimal procedure for the scheduling of activities to maximize the net present value of projects
- An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations
- Optimal procedures for the discrete time/cost trade-off problem in project networks
- Scheduling programs with repetitive projects: A comparison of a simulated annealing, a genetic and a pair-wise swap algorithm
- Project network models with discounted cash flows a guided tour through recent developments
- PSPLIB -- a project scheduling problem library
- Using tabu search to schedule activities of stochastic resource-constrained projects
- A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows
- Connectionist approaches for solver selection in constrained project scheduling
- A steepest ascent approach to maximizing the net present value of projects
- A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.
- Order-based neighborhoods for project scheduling with nonregular objective functions.
- An equitable approach to the payment scheduling problem in project management
- Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints
- Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models
- Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
- New computational results for the discrete time/cost trade-off problem with time-switch constraints
- Progress payments in project scheduling problems.
- 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
- Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times
- Discrete-continuous project scheduling with discounted cash flows - a tabu search approach
- Multi-mode project payment scheduling problems with bonus-penalty structure
- A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling
- Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
- On Maximizing the Net Present Value of a Project Under Renewable Resource Constraints
- Project Contracts and Payment Schedules: The Client's Problem
- New computational results on the discrete time/cost trade-off problem in project networks
- The Impact of Contractor Behavior on the Client’s Payment-Scheduling Problem
- The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
- Tabu Search Applied to the Quadratic Assignment Problem
- Decision CPM: Network Reduction and Solution
- A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
- Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach
- A Dynamic Programming Algorithm for Decision CPM Networks
- Resource-constrained project scheduling by simulated annealing
- A branch and bound algorithm for scheduling projects to maximize net present value: The case of time dependent, contingent cash flows
- Scheduling project activities to maximize the net present value the case of linear time-dependent cash flows
- A simulated annealing algorithm for resource constrained project scheduling problems
- On modelling payments in projects
- A Branch and Bound Procedure for the Resource Constrained Project Scheduling Problem with Discounted Cash Flows
- Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
- Heuristic scheduling of resource-constrained projects with cash flows
- Maximizing the net present value of a project with linear time-dependent cash flows
- Solving time/cost trade-off problems with discounted cash flows using generalized benders decomposition
- Cash Flows in Networks
- The payment scheduling problem
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- Project Scheduling with Discounted Cash Flows and Progress Payments
- A two stage search heuristic for scheduling payments in projects
- Maximizing the net present value of a project under resource constraints using a Lagrangian relaxation based heuristic with tight upper bounds
- Four payment models for the multi-mode resource constrained project scheduling problem with discounted cash flows
This page was built for publication: Simulated annealing and tabu search for multi-mode project payment scheduling
