Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems

DOI10.1016/0377-2217(90)90121-QzbMath1403.90678MaRDI QIDQ721682

F. Brian Talbot, James H. Patterson, Slowinski, Roman, Jan Weglarz

Publication date: 19 July 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

integer programmingboundproject managementnet present valueresource-constrained schedulingbranch \& bound

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (36)

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 ⋮ Hierarchical models for multi-project planning and scheduling ⋮ Constrained multi-project planning problems: A Lagrangean decomposition approach ⋮ DSS for multiobjective project scheduling ⋮ A local constraint based analysis approach to project scheduling under general resource constraints ⋮ Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling ⋮ A flexible heuristic for a multi-mode capital constrained project scheduling problem with probabilistic cash inflows ⋮ Solving the resource constrained project scheduling problem with optimization subroutine library ⋮ A comparison of stochastic scheduling rules for maximizing project net present value ⋮ Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem ⋮ An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: the single mode case ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ Resource-constrained project scheduling: A survey of recent developments. ⋮ A constraint-based perspective in resource constrained project scheduling ⋮ A hybrid rank-based evolutionary algorithm applied to multi-mode resource-constrained project scheduling problem ⋮ Theoretical aspects of multicriteria flight gate scheduling: Deterministic and fuzzy models ⋮ A robust optimization approach for the multi-mode resource-constrained project scheduling problem ⋮ Resource-constrained project scheduling: Notation, classification, models, and methods ⋮ The multi-mode resource-constrained project scheduling problem with generalized precedence relations ⋮ Progress payments in project scheduling problems. ⋮ An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations ⋮ A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes ⋮ A framework for an interactive project scheduling system under limited resources ⋮ Project network models with discounted cash flows a guided tour through recent developments ⋮ A genetic algorithm for multi-mode resource constrained project scheduling problem ⋮ PSPLIB -- a project scheduling problem library ⋮ Simulated annealing and tabu search for multi-mode project payment scheduling ⋮ Activity list representation for a generalization of the resource-constrained project scheduling problem ⋮ Project scheduling under resource and mode identity constraints: Model, complexity, methods, and application ⋮ A model to optimize project resource allocation by construction of a balanced histogram ⋮ Bicriteria train scheduling for high-speed passenger railroad planning applications ⋮ The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure ⋮ Interactive analysis of multiple-criteria project scheduling problems ⋮ Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm ⋮ Resource-constrained project scheduling by simulated annealing

Uses Software

• Algorithm 520

Cites Work

• Unnamed Item
• Unnamed Item
• Multiobjective network scheduling with efficient use of renewable and nonrenewable resources
• ON CERTAIN MODELS OF RESOURCE ALLOCATION PROBLEMS
• Two Approaches to Problems of Resource Allocation among Project Activities -- A Comparative Study
• Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
• A Horizon-Varying, Zero-One Approach to Project Scheduling
• Scheduling a Project to Maximize Its Present Value: A Zero-One Programming Approach
• Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
• An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
• A Dynamic Programming Algorithm for Decision CPM Networks
• An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints

This page was built for publication: Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems