Simulated annealing for centralised resource-constrained multiproject scheduling to minimise the maximal cash flow gap under different payment patterns

DOI10.1007/S10479-023-05580-3MaRDI QIDQ6588469zbMATH OpenFDO

Authors Yukang He, Tao Jia, Weibo Zheng

Publication date 15 August 2024

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10479-023-05580-3

zbMATH Keywords

maximum cash flow gapmultiproject schedulingoptimisation modelpayment patternsimulated annealing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Tabu search and simulated annealing for resource-constrained multi-project scheduling to minimize maximal cash flow gap
• Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models
• Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective
• Simulated annealing and tabu search for multi-mode project payment scheduling
• Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap

Cites work

• A column generation-based diving heuristic to solve the multi-project personnel staffing problem with calendar constraints and resource sharing
• A decomposition approach to multi-project scheduling
• A flexible heuristic for a multi-mode capital constrained project scheduling problem with probabilistic cash inflows
• A genetic algorithm for the resource constrained multi-project scheduling problem
• A multi-threaded local search algorithm and computer implementation for the multi-mode, resource-constrained multi-project scheduling problem
• A multicriteria heuristic method to improve resource allocation in multiproject scheduling
• A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.
• A random generator of resource-constrained multi-project network problems
• A simulated annealing algorithm for resource constrained project scheduling problems
• A two stage search heuristic for scheduling payments in projects
• Analysis of scheduling schemes and heuristic rules performance in resource-constrained multiproject scheduling
• Capital- and resource-constrained project scheduling with net present value optimization
• Cash Flows in Networks
• Client‐contractor bargaining on net present value in project scheduling with limited resources
• Discrete-continuous project scheduling with discounted cash flows - a tabu search approach
• Equation of state calculations by fast computing machines
• Four payment models for the multi-mode resource constrained project scheduling problem with discounted cash flows
• Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem
• Interactive analysis of multiple-criteria project scheduling problems
• Managing and modelling general resource transfers in (multi-)project scheduling
• Metaheuristics for multi-mode capital-constrained project payment scheduling
• Multi-mode project payment scheduling problems with bonus-penalty structure
• Multi-mode resource constrained multi-project scheduling and resource portfolio problem
• Multi-project scheduling with two-stage decomposition
• Multi-Project Scheduling: Categorization of Heuristic Rules Performance
• New summary measures and datasets for the multi-project scheduling problem
• Project network models with discounted cash flows a guided tour through recent developments
• Resource-constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics
• Resource-constrained project scheduling by simulated annealing
• Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach
• Scheduling programs with repetitive projects: A comparison of a simulated annealing, a genetic and a pair-wise swap algorithm
• Scheduling projects to maximize net present value -- the case of time-dependent, contingent cash flows
• Scheduling subject to resource constraints: Classification and complexity
• Simulated annealing and tabu search for multi-mode project payment scheduling
• Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models
• Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective
• Simulated annealing for multi-mode resource-constrained project scheduling
• Tabu search and simulated annealing for resource-constrained multi-project scheduling to minimize maximal cash flow gap
• Tabu search for dedicated resource-constrained multiproject scheduling to minimise the maximal cash flow gap under uncertainty
• Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times
• Using metaheuristics in multiobjective resource constrained project scheduling
• Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap

This page was built for publication: Simulated annealing for centralised resource-constrained multiproject scheduling to minimise the maximal cash flow gap under different payment patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6588469)