Potentiels sur un graphe non conjonctif et analyse d'un problème d'ordonnancement à moyens limites

DOI10.1051/ro/1979130403631zbMath0424.90033OpenAlexW2587063602MaRDI QIDQ3859550

G. Fontan, Jacques Erschler, François Roubellat

Publication date: 1979

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

Full work available at URL: https://eudml.org/doc/104740

zbMATH Keywords

graph theoryproject managementmultiprojects scheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Applications of graph theory to circuits and networks (94C15)

This page was built for publication: Potentiels sur un graphe non conjonctif et analyse d'un problème d'ordonnancement à moyens limites