Comparison of three classical lower bounds for the parallel machines scheduling problem

DOI10.1051/RO/2025043MaRDI QIDQ6957013zbMATH OpenFDO

Authors Jacques Carlier, Éric Pinson, Abderrahim Sahli, Antoine Jouglet

Publication date 17 July 2025

Published in RAIRO. Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

lower boundschedulingenergetic reasoningcumulative resource

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Deterministic scheduling theory in operations research (90B35) Flows in graphs (05C21)

This page was built for publication: Comparison of three classical lower bounds for the parallel machines scheduling problem

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