Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer

DOI10.1016/0377-2217(87)90240-2zbMATH Open0614.90056OpenAlexW2024237395MaRDI QIDQ1820682FDOQ1820682

Authors: Nicos Christofides, Ramón Alvarez-Valdes, José Manuel Tamarit 

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0377-2217(87)90240-2

Recommendations

• A branch-and-bound algorithm for the resource-constrained project scheduling problem
• scientific article; zbMATH DE number 1264426
• A branch and bound algorithm for the resource-constrained project scheduling problem
• On some implementations of solving the resource constrained project scheduling problems
• scientific article; zbMATH DE number 34437

zbMATH Keywords

Lagrange multiplierscutting planesrelaxationresource constraintsproject schedulingcomputational resultsbranch and bound algorithmlongest path

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cites Work

• Validation of subgradient optimization
• An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
• An Algorithm for the Line Balancing Problem
• An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• Title not available (Why is that?)
• An Algorithm for Project (Job) Sequencing with Resource Constraints
• Technical Note—An Improved Feasibility Test for Gorenstein's Algorithm

Cited In (only showing first 100 items - show all)

• A scatter search algorithm for project scheduling under partially renewable resources
• A comparative study of computational procedures for the resource constrained project scheduling problem
• Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling
• Transportation problem with nonlinear side constraints a branch and bound approach
• Project scheduling with finite or infinite number of activity processing modes -- a survey
• A new branch and bound algorithm for cell formation problem
• A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem
• Increasing airport capacity utilisation through optimum slot scheduling: review of current developments and identification of future needs
• A framework for an interactive project scheduling system under limited resources
• Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources
• An exact algorithm for an integrated project staffing problem with a homogeneous workforce
• MIP models for resource-constrained project scheduling with flexible resource profiles
• A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations
• Theoretical aspects of multicriteria flight gate scheduling: Deterministic and fuzzy models
• Project scheduling with flexible resources: formulation and inequalities
• Scheduling a project to maximize its net present value: An integer programming approach
• Scheduling of design projects with uncertain number of iterations
• Event-based MILP models for resource-constrained project scheduling problems
• The resource-constrained modulo scheduling problem: an experimental study
• On project scheduling with irregular starting time costs
• Dynamic resource allocation: a flexible and tractable modeling framework
• A time indexed formulation of non-preemptive single machine scheduling problems
• Note: On Semi-Active Timetabling in Resource-Constrained Project Scheduling
• Simplifying multiproject scheduling problem based on design structure matrix and its solution by an improved aiNet algorithm
• A local constraint based analysis approach to project scheduling under general resource constraints
• Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
• Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
• A branch and bound algorithm for the resource-constrained project scheduling problem
• Simulated annealing for resource-constrained scheduling
• Exact algorithms for single-machine scheduling with time windows and precedence constraints
• Activity nets: A guided tour through some recent developments
• Resource-constrained project scheduling: A survey of recent developments.
• The multiple resource constrained project scheduling problem: A breadth-first approach
• A preemptive bound for the resource constrained project scheduling problem
• Optimal solutions for a dock assignment problem with trailer transportation
• A comparison of stochastic scheduling rules for maximizing project net present value
• Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars
• A polyhedral study of event-based models for the resource-constrained project scheduling problem
• Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
• Constrained multi-project planning problems: A Lagrangean decomposition approach
• Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Scheduling and constraint propagation
• On the use of the complexity index as a measure of complexity in activity networks
• Mixed-integer linear programming for resource leveling problems
• The project scheduling problem with irregular starting time costs
• A dynamic intelligent decision approach to dependency modeling of project tasks in complex engineering system optimization
• An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• Continuous-time formulations for multi-mode project scheduling
• Project network models with discounted cash flows a guided tour through recent developments
• Scheduling projects with variable-intensity activities: The case of dynamic earliness and tardiness costs
• Scheduling identical parallel machines to minimize total weighted completion time
• A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.
• On linear lower bounds for the resource constrained project scheduling problem.
• Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
• A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints
• A note on an iterative forward/backward scheduling technique with reference to a procedure by Li and Willis
• A genetic algorithm for multi-mode resource constrained project scheduling problem
• A neurogenetic approach for the resource-constrained project scheduling problem
• Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
• PSPLIB -- a project scheduling problem library
• The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure
• An exact algorithm for project scheduling with multiple modes
• Column generation for vehicle routing problems with multiple synchronization constraints
• A high-performance exact method for the resource-constrained project scheduling problem
• GRASP and path relinking for project scheduling under partially renewable resources
• The project scheduling polyhedron: Dimension, facets and lifting theorems
• Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
• Hierarchical models for multi-project planning and scheduling
• Kapazitätsplanung in Netzwerken. Ein Überblick über neuere Modelle und Verfahren. (Resource-constrained project planning in networks. A survey on new models and methods)
• A constraint-based perspective in resource constrained project scheduling
• An efficient multi-pass heuristic for project scheduling with constrained resources
• Resource-constrained project scheduling by simulated annealing
• Mode-based versus activity-based search for a nonredundant resolution of the multimode resource-constrained project scheduling problem
• Solving the resource constrained project scheduling problem with optimization subroutine library
• On the strength of time-indexed formulations for the resource-constrained project scheduling problem
• Reducing the feasible solution space of resource-constrained project instances
• MINLP‐based hybrid strategy for operating mode selection of TES‐backed‐up refrigeration systems
• Improved formulations and new valid inequalities for a hybrid flow shop problem with time-varying resources and chaining time-lag
• A multiple-tree search procedure for the resource-constrained project scheduling problem
• A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling
• Solving a real-life multi-skill resource-constrained multi-project scheduling problem
• On a paper by Christofides et al. for solving the multiple-resource constrained, single project scheduling problem
• Towards merging binary integer programming techniques with genetic algorithms
• Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems
• Modeling frameworks for the multi‐skill resource‐constrained project scheduling problem: a theoretical and empirical comparison
• A hybrid framework for over-constrained generalized resource-constrained project scheduling problems
• A decomposition approach for a resource constrained scheduling problem
• The sample analysis machine scheduling problem: definition and comparison of exact solving approaches
• An improved decomposition-based heuristic for truck platooning
• An exact composite lower bound strategy for the resource-constrained project scheduling problem
• Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
• Going to the core of hard resource-constrained project scheduling instances
• A new mathematical model for hybrid flow shop under time-varying resource and exact time-lag constraints
• A decomposition approach in a DSS for a resource constrained scheduling problem
• An adapted constraint-programming formulation of the resource-constrained project scheduling problem applied to the identical parallel machines group shop and mixed shop scheduling problems
• A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem
• An integrated approach for allocation and scheduling-location problems on graphs
• Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining

This page was built for publication: Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer

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