A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring

From MaRDI portal
Publication:6047981

DOI10.1134/s000511792302008xzbMath1521.90073OpenAlexW4385844240MaRDI QIDQ6047981

Yuri N. Sotskov

Publication date: 13 September 2023

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s000511792302008x






Cites Work


This page was built for publication: A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring