Polyhedral Results and Branch-and-Cut for the Resource Loading Problem

DOI10.1287/ijoc.2020.0957zbMath1466.90045OpenAlexW3034520576MaRDI QIDQ4995060

Roel Leus, Tamás Kis, Guopeng Song

Publication date: 23 June 2021

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/retrieve/541157

zbMATH Keywords

mixed integer programmingbranch-and-cutfacetscapacity planning

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Theory of organizations, manpower planning in operations research (90B70)

Related Items

Ideal, non-extended formulations for disjunctive constraints admitting a network representation

Uses Software

• LEMON
• RanGen

Cites Work

• Unnamed Item
• Unnamed Item
• MIP models for resource-constrained project scheduling with flexible resource profiles
• Resource loading with time windows
• Scheduling malleable tasks on parallel processors to minimize the makespan
• Maximising the weighted number of activity execution modes in project planning
• A priority-rule method for project scheduling with work-content constraints
• A time indexed formulation of non-preemptive single machine scheduling problems
• Disjunctive programming: Properties of the convex hull of feasible points
• On the strength of time-indexed formulations for the resource-constrained project scheduling problem
• Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem
• Mixed-integer linear programming for resource leveling problems
• Rangen: A random network generator for activity-on-the-node networks
• A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
• An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
• Solving Project Scheduling Problems by Minimum Cut Computations
• Maximal Flow Through a Network
• A new approach to the maximum-flow problem
• The Resource Constrained Project Scheduling Problem: A theoretical comparison between a recent formulation and the main time indexed linear programming based approaches
• Scenario-based approach for flexible resource loading under uncertainty
• Disjunctive Programming
• Minimizing Resource Availability Costs in Time-Limited Project Networks
• Scheduling projects with labor constraints

This page was built for publication: Polyhedral Results and Branch-and-Cut for the Resource Loading Problem