An integer-valued model for the problem of minimizing the total servicing time of unit claims with parallel devices with precedences

Authors:
R. Yu. Simanchev;I. V. Urazova
Affiliations:
Omsk State University, Omsk, Russia;Omsk State University, Omsk, Russia
Venue:
Automation and Remote Control
Year:
2010

Citing 3
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Graph theory: An algorithmic approach (Computer science and applied mathematics)

Graph theory: An algorithmic approach (Computer science and applied mathematics)
Complex Scheduling (GOR-Publications)

Complex Scheduling (GOR-Publications)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe an integer-valued model of the total service time minimization problem for a partially ordered set of claims with identical servicing times, serviced in parallel by identical devices. We construct a target function over the polyhedron corresponding to the problem. We give results of a numerical experiment that deal with the variance of the total service time and the structure of the schedules' convex hull.