Polynomial algorithms for some scheduling problems with one nonrenewable resource

DOI10.1051/ro/2021164zbMath1483.90058OpenAlexW3208958700MaRDI QIDQ5034755

Aziz Moukrim, Jacques Carlier, Abderrahim Sahli

Publication date: 21 February 2022

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2021164

zbMATH Keywords

decomposition methodscheduling problemsseries-parallel graphnonrenewable resourceinterval order graph

Mathematics Subject Classification ID

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

This page was built for publication: Polynomial algorithms for some scheduling problems with one nonrenewable resource