This article is cited in 1 paper

Optimization, System Analysis, and Operations Research

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

Yu. N. Sotskov

United Institute of Informatics Problems, National Academy of Sciences of Belarus, Minsk, Belarus

Keywords: schedule, preemption, makespan optimality, mixed graph, optimal coloring.

Presented by the member of Editorial Board: P. Yu. Chebotarev

Received: 04.11.2021
Revised: 15.08.2022
Accepted: 29.09.2022

DOI: 10.31857/S0005231023010075

 English version: Automation and Remote Control, 2023, 84:2, 167–186