Comparison of integer models of the single-demands servicing problem with precedencies by parallel devices
Inna V. Urazova, E. S. Afonkin
Source record
Source: Crossref
Published: Aug 31, 2026
DOI: 10.24147/2222-8772.2026.2.63-67
Open original source ↗Source abstract
The scheduling problem of minimization of the general service time of identical requirements with precedence by parallel machines is considered. Two integer linear programming models for this problem are described. A comparative analysis of the models is performed, and a computational experiment is detailed. The number of machines was three. During the experiment, exact solutions were obtained for graph problems with sizes ranging from 10 to 60 vertices.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.