Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
From MaRDI portal
Publication:1820682
DOI10.1016/0377-2217(87)90240-2zbMath0614.90056OpenAlexW2024237395MaRDI QIDQ1820682
Nicos Christofides, Ramón Alvarez-Valdés, 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
Lagrange multipliersproject schedulingrelaxationcutting planescomputational resultsbranch and bound algorithmlongest pathresource constraints
Related Items (95)
Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling ⋮ On a paper by Christofides et al. for solving the multiple-resource constrained, single project scheduling problem ⋮ Polynomially solvable cases of the project scheduling problem with changing consumption and supply rates of nonaccumulative resources ⋮ A decomposition approach for a resource constrained scheduling problem ⋮ An exact algorithm for an integrated project staffing problem with a homogeneous workforce ⋮ Scheduling a project to maximize its net present value: An integer programming approach ⋮ Hierarchical models for multi-project planning and scheduling ⋮ The project scheduling polyhedron: Dimension, facets and lifting theorems ⋮ A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem ⋮ MIP models for resource-constrained project scheduling with flexible resource profiles ⋮ Constrained multi-project planning problems: A Lagrangean decomposition approach ⋮ A decomposition approach in a DSS for a resource constrained scheduling problem ⋮ A local constraint based analysis approach to project scheduling under general resource constraints ⋮ Dynamic resource allocation: a flexible and tractable modeling framework ⋮ The resource-constrained modulo scheduling problem: an experimental study ⋮ A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations ⋮ Exact algorithms for single-machine scheduling with time windows and precedence constraints ⋮ The sample analysis machine scheduling problem: definition and comparison of exact solving approaches ⋮ Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining ⋮ Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars ⋮ An exact composite lower bound strategy for the resource-constrained project scheduling problem ⋮ An exact algorithm for project scheduling with multiple modes ⋮ Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production ⋮ Transportation problem with nonlinear side constraints a branch and bound approach ⋮ A polyhedral study of event-based models for the resource-constrained project scheduling problem ⋮ Solving the resource constrained project scheduling problem with optimization subroutine library ⋮ Going to the core of hard resource-constrained project scheduling instances ⋮ Scheduling of design projects with uncertain number of iterations ⋮ 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 ⋮ Mixed-integer linear programming for resource leveling problems ⋮ Activity nets: A guided tour through some recent developments ⋮ A preemptive bound for the resource constrained project scheduling problem ⋮ An improved decomposition-based heuristic for truck platooning ⋮ MINLP‐based hybrid strategy for operating mode selection of TES‐backed‐up refrigeration systems ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ Modeling frameworks for the multi‐skill resource‐constrained project scheduling problem: a theoretical and empirical comparison ⋮ A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem ⋮ 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. ⋮ Continuous-time formulations for multi-mode project scheduling ⋮ Resource-constrained project scheduling: A survey of recent developments. ⋮ Increasing airport capacity utilisation through optimum slot scheduling: review of current developments and identification of future needs ⋮ Project scheduling with flexible resources: formulation and inequalities ⋮ Simplifying multiproject scheduling problem based on design structure matrix and its solution by an improved aiNet algorithm ⋮ An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem ⋮ Branch and bound algorithms for resource constrained project scheduling problem subject to nonrenewable resources with prescheduled procurement ⋮ Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements ⋮ Solving the resource-constrained project scheduling problem by a variable neighbourhood search. ⋮ A dynamic intelligent decision approach to dependency modeling of project tasks in complex engineering system optimization ⋮ The project scheduling problem with irregular starting time costs ⋮ On the strength of time-indexed formulations for the resource-constrained project scheduling problem ⋮ A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling ⋮ Towards merging binary integer programming techniques with genetic algorithms ⋮ Column generation for vehicle routing problems with multiple synchronization constraints ⋮ A time indexed formulation of non-preemptive single machine scheduling problems ⋮ Mode-based versus activity-based search for a nonredundant resolution of the multimode resource-constrained project scheduling problem ⋮ Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems ⋮ A new branch and bound algorithm for cell formation problem ⋮ GRASP and path relinking for project scheduling under partially renewable resources ⋮ Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem ⋮ Scheduling and constraint propagation ⋮ A constraint-based perspective in resource constrained project scheduling ⋮ A hybrid framework for over-constrained generalized resource-constrained project scheduling problems ⋮ A scatter search algorithm for project scheduling under partially renewable resources ⋮ Event-based MILP models for resource-constrained project scheduling problems ⋮ A neurogenetic approach for the resource-constrained project scheduling problem ⋮ On project scheduling with irregular starting time costs ⋮ Theoretical aspects of multicriteria flight gate scheduling: Deterministic and fuzzy models ⋮ 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 high-performance exact method for the resource-constrained project scheduling problem ⋮ A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints ⋮ Optimal solutions for a dock assignment problem with trailer transportation ⋮ Resource-constrained project scheduling: Notation, classification, models, and methods ⋮ Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling ⋮ The multiple resource constrained project scheduling problem: A breadth-first approach ⋮ Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation ⋮ A framework for an interactive project scheduling system under limited resources ⋮ A note on an iterative forward/backward scheduling technique with reference to a procedure by Li and Willis ⋮ A multiple-tree search procedure for the resource-constrained project scheduling problem ⋮ A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem ⋮ An efficient multi-pass heuristic for project scheduling with constrained 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 ⋮ On the use of the complexity index as a measure of complexity in activity networks ⋮ PSPLIB -- a project scheduling problem library ⋮ The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure ⋮ A branch and bound algorithm for the resource-constrained project scheduling problem ⋮ Strong bounds for resource constrained project scheduling: preprocessing and cutting planes ⋮ Scheduling projects with variable-intensity activities: The case of dynamic earliness and tardiness costs ⋮ Resource-constrained project scheduling by simulated annealing ⋮ Simulated annealing for resource-constrained scheduling ⋮ Improved formulations and new valid inequalities for a hybrid flow shop problem with time-varying resources and chaining time-lag ⋮ Scheduling identical parallel machines to minimize total weighted completion time ⋮ A comparative study of computational procedures for the resource constrained project scheduling problem
Cites Work
- Unnamed Item
- Technical Note—An Improved Feasibility Test for Gorenstein's Algorithm
- An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
- Validation of subgradient optimization
- An Algorithm for the Line Balancing Problem
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints
- An Algorithm for Project (Job) Sequencing with Resource Constraints
This page was built for publication: Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer