Approximation algorithms for demand-based job scheduling with reconfigurable resources

DOI10.1016/J.DAM.2025.11.032MaRDI QIDQ6866647zbMATH OpenFDO

Authors Pierre Bergé, Mari Chaikovskaia, Jean-Philippe Gayon, Alain Quilliot

Publication date 28 January 2026

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.11.032

zbMATH Keywords

approximation algorithmreconfigurable resourcesscheduling

Mathematics Subject Classification ID

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

Cites work

• A framework for the complexity of high-multiplicity scheduling problems
• A polynomial algorithm for multiprocessor scheduling with two job lengths.
• An Application of Bin-Packing to Multiprocessor Scheduling
• Approximation algorithm for job scheduling with reconfigurable resources
• Bounds on Multiprocessing Timing Anomalies
• Combinatorial \(n\)-fold integer programming and applications
• Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time
• Multi-resource shop scheduling with resource flexibility
• On the exact upper bound for the Multifit processor scheduling algorithm
• Parameterized complexity of machine scheduling: 15 open problems
• Scheduling and fixed-parameter tractability
• The multi-mode resource investment problem: a benchmark library and a computational study of lower and upper bounds

This page was built for publication: Approximation algorithms for demand-based job scheduling with reconfigurable resources

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