A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem
From MaRDI portal
Publication:2892296
DOI10.1287/ijoc.1040.0121zbMath1241.90168OpenAlexW2117837254MaRDI QIDQ2892296
Jonathan F. Bard, Gang Yu, Guidong Zhu
Publication date: 18 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1040.0121
Related Items (31)
Meta-heuristic solution with considering setup time for multi-skilled project scheduling problem ⋮ On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations ⋮ An efficient metaheuristic for integrated scheduling and staffing IT projects based on a generalized minimum cost flow network ⋮ Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting ⋮ A path-relinking algorithm for the multi-mode resource-constrained project scheduling problem ⋮ A polyhedral study of event-based models for the resource-constrained project scheduling problem ⋮ Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic ⋮ Using resource scarceness characteristics to solve the multi-mode resource-constrained project scheduling problem ⋮ A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement ⋮ Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers ⋮ Project scheduling with flexible resources: formulation and inequalities ⋮ A modified PSO algorithm for minimizing the total costs of resources in MRCPSP ⋮ Branch and bound algorithms for resource constrained project scheduling problem subject to nonrenewable resources with prescheduled procurement ⋮ Multimode preemptive resource investment problem subject to due dates for activities: formulation and solution procedure ⋮ Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach ⋮ A practical and robust execution time-frame procedure for the multi-mode resource-constrained project scheduling problem with minimal and maximal time lags ⋮ A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling ⋮ Mode-based versus activity-based search for a nonredundant resolution of the multimode resource-constrained project scheduling problem ⋮ A local branching heuristic for the open pit mine production scheduling problem ⋮ An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances ⋮ Event-based MILP models for resource-constrained project scheduling problems ⋮ Reactive scheduling in the multi-mode RCPSP ⋮ A survey of variants and extensions of the resource-constrained project scheduling problem ⋮ A distributionally robust analysis of the program evaluation and review technique ⋮ A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting ⋮ Bi-level multiple mode resource-constrained project scheduling problems under hybrid uncertainty ⋮ A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem ⋮ A multiobjective hybrid ant colony optimization approach applied to the assignment and scheduling problem ⋮ Strong bounds for resource constrained project scheduling: preprocessing and cutting planes ⋮ A computational study of constraint programming approaches for resource-constrained project scheduling with autonomous learning effects
Uses Software
This page was built for publication: A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem
