Approximation algorithm for job scheduling with reconfigurable resources

DOI10.1007/978-3-031-60924-4_20MaRDI QIDQ7030717zbMATH OpenFDO

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

Publication date 7 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-60924-4_20

zbMATH Keywords

approximationreconfigurationscheduling

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• A polynomial algorithm for multiprocessor scheduling with two job lengths.
• An Application of Bin-Packing to Multiprocessor Scheduling
• An updated survey of variants and extensions of the resource-constrained project scheduling problem
• Assembly line balancing: what happened in the last fifteen years?
• Bounds on Multiprocessing Timing Anomalies
• Multi-mode resource constrained multi-project scheduling and resource portfolio problem
• Scheduling and fixed-parameter tractability

Cited in

(1)

• Approximation algorithms for demand-based job scheduling with reconfigurable resources

This page was built for publication: Approximation algorithm for job scheduling with reconfigurable resources

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