A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement
From MaRDI portal
Publication:900590
DOI10.1007/s13369-014-1319-9zbMath1401.90088OpenAlexW2069967121MaRDI QIDQ900590
Shahram Shadrokh, Ali Shirzadeh Chaleshtarti
Publication date: 22 December 2015
Published in: Arabian Journal for Science and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13369-014-1319-9
project schedulingbranch and cutresource constraintsnonrenewable resources with prescheduled procurement
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)
Uses Software
Cites Work
- Some efficient multi-heuristic procedures for resource-constrained project scheduling
- Min-max optimization of several classical discrete optimization problems
- Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming
- Project scheduling. A research handbook.
- Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
- Resource-constrained project scheduling: Notation, classification, models, and methods
- GRASP and path relinking for project scheduling under partially renewable resources
- A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
- A scatter search algorithm for project scheduling under partially renewable resources
- Allocation of partially renewable resources: Concept, capabilities, and applications
- A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem
- Project Scheduling Under Partially Renewable Resource Constraints
- Solving Large-Scale Zero-One Linear Programming Problems
- An Algorithm for Solving the Job-Shop Problem
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- A simulated annealing algorithm for resource constrained project scheduling problems
- A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Surrogate Constraints
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
