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

DOI10.1016/0377-2217(90)90121-QzbMATH Open1403.90678MaRDI QIDQ721682FDOQ721682

F. Brian Talbot, James H. Patterson, Roman Słowiński, Jan Węglarz

Publication date: 19 July 2018

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

Recommendations

• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• scientific article; zbMATH DE number 1264426
• A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem
• An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem
• scientific article

zbMATH Keywords

integer programmingboundnet present valueproject managementresource-constrained schedulingbranch \& bound

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (37)

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

Uses Software

• Algorithm 520

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

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