Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements

DOI10.1016/j.disopt.2007.10.003zbMath1134.90016OpenAlexW1974221729MaRDI QIDQ924628

Jill R. Hardin, Nemhauser, George I., Savelsbergh, Martin W. P.

Publication date: 16 May 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2007.10.003

zbMATH Keywords

liftingmultiprocessor schedulingvalid inequalitiesresource-constrained schedulingtime-indexed formulation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations ⋮ Branch-and-Cut-and-Price algorithms for the preemptive RCPSP ⋮ A polyhedral study of event-based models for the resource-constrained project scheduling problem ⋮ An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem ⋮ On the strength of time-indexed formulations 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 ⋮ Strong bounds for resource constrained project scheduling: preprocessing and cutting planes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling multiprocessor tasks -- An overview
• Resource-constrained project scheduling: A critical activity reordering heuristic
• A branch-and-bound algorithm for the resource-constrained project scheduling problem
• Resource-constrained project scheduling: A survey of recent developments.
• Project scheduling. A research handbook.
• Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
• A polyhedral approach to single-machine scheduling problems.
• A linear programming and constraint propagation-based lower bound for the RCPSP
• Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Sequence independent lifting in mixed integer programming
• The project scheduling polyhedron: Dimension, facets and lifting theorems
• Resource constrained scheduling on multiple machines
• A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
• Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
• An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
• Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem
• A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints
• Solving Project Scheduling Problems by Minimum Cut Computations
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• Facets of the knapsack polytope
• Valid Inequalities and Superadditivity for 0–1 Integer Programs
• A high-performance exact method for the resource-constrained project scheduling problem

This page was built for publication: Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements