Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
type: Item
instance of: scholarly article
title: Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
zbMATH Open document ID: 1134.90016
author: Jill R. Hardin
author: G. L. Nemhauser
author: Martin W. P. Savelsbergh
published in: Discrete Optimization
publication date: 2008-05-16T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5276149
zbMATH Keywords: resource-constrained scheduling
zbMATH Keywords: multiprocessor scheduling
zbMATH Keywords: time-indexed formulation
zbMATH Keywords: valid inequalities
zbMATH Keywords: lifting
MaRDI profile type: Publication
full work available at URL: j.disopt.2007.10.003
OpenAlex ID: W1974221729
cites work: Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
cites work: Project scheduling. A research handbook.
cites work: Resource-constrained project scheduling: A critical activity reordering heuristic
cites work: Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
cites work: Resource constrained scheduling on multiple machines
cites work: A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
cites work: A linear programming and constraint propagation-based lower bound for the RCPSP
cites work: A high-performance exact method for the resource-constrained project scheduling problem
cites work: An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
cites work: Solving Project Scheduling Problems by Minimum Cut Computations
cites work: Resource-constrained project scheduling: A survey of recent developments.
cites work: The project scheduling polyhedron: Dimension, facets and lifting theorems
cites work: Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
cites work: A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
cites work: A branch-and-bound algorithm for the resource-constrained project scheduling problem
cites work: A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints
cites work: Constraint-propagation-based cutting planes: an application to the resource-constrained project scheduling problem
cites work: Scheduling multiprocessor tasks -- An overview
cites work: Q4238573
cites work: Q4658190
cites work: Valid Inequalities and Superadditivity for 0–1 Integer Programs
cites work: Sequence independent lifting in mixed integer programming
cites work: Facets of the knapsack polytope
cites work: Q4040221
cites work: Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
cites work: A polyhedral approach to single-machine scheduling problems.
DOI: 10.1016/J.DISOPT.2007.10.003
description: scientific article; zbMATH DE number 5276149