Approximation results on resource leveling problems

DOI10.1016/J.TCS.2025.115430MaRDI QIDQ6930239zbMATH OpenFDO

Authors Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier

Publication date 16 September 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115430

zbMATH Keywords

approximation algorithmsresource levelingscheduling

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Cites work

• A common approximation framework for early work, late work, and resource leveling problems
• A metaheuristic solution approach for the time-constrained project scheduling problem
• An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem
• An effective heuristic for project scheduling with resource availability cost
• An updated survey of variants and extensions of the resource-constrained project scheduling problem
• Exponential Time Complexity of the Permanent and the Tutte Polynomial
• Load balancing: the long road from theory to practice
• Minimizing Resource Availability Costs in Time-Limited Project Networks
• Mixed-integer linear programming for resource leveling problems
• On Integer Programming, Discrepancy, and Convolution
• Optimal project duration for resource leveling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Resource leveling in a machine environment
• Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities
• Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique

This page was built for publication: Approximation results on resource leveling problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6930239)