Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine

DOI10.1051/ro:1999109zbMath0960.90038OpenAlexW2142775601MaRDI QIDQ4497861

No author found.

Publication date: 24 August 2000

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

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

zbMATH Keywords

schedulingfeasibilitytemporal decomposition

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

On not-first/not-last conditions in disjunctive scheduling

This page was built for publication: Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine