A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement
type: Item
instance of: scholarly article
title: A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement
zbMATH Open document ID: 1401.90088
author: Ali Shirzadeh Chaleshtarti
author: Shahram Shadrokh
published in: Arabian Journal for Science and Engineering
publication date: 2015-12-22T00:00:00Z
Mathematics Subject Classification ID: 90B50
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6523533
zbMATH Keywords: project scheduling
zbMATH Keywords: resource constraints
zbMATH Keywords: nonrenewable resources with prescheduled procurement
zbMATH Keywords: branch and cut
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: s13369-014-1319-9
OpenAlex ID: W2069967121
cites work: Project Scheduling Under Partially Renewable Resource Constraints
cites work: A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
cites work: A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem
cites work: A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
cites work: Resource-constrained project scheduling: Notation, classification, models, and methods
cites work: Some efficient multi-heuristic procedures for resource-constrained project scheduling
cites work: A simulated annealing algorithm for resource constrained project scheduling problems
cites work: Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
cites work: Facets of the knapsack polytope
cites work: Project scheduling. A research handbook.
cites work: Allocation of partially renewable resources: Concept, capabilities, and applications
cites work: A scatter search algorithm for project scheduling under partially renewable resources
cites work: GRASP and path relinking for project scheduling under partially renewable resources
cites work: An Algorithm for Solving the Job-Shop Problem
cites work: Facet of regular 0–1 polytopes
cites work: Faces for a linear inequality in 0–1 variables
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: Surrogate Constraints
cites work: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
cites work: Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming
cites work: Min-max optimization of several classical discrete optimization problems
cites work: An Additive Algorithm for Solving Linear Programs with Zero-One Variables
DOI: 10.1007/S13369-014-1319-9
description: scientific article; zbMATH DE number 6523533