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

DOI10.1134/S0005117910100097zbMath1218.93055MaRDI QIDQ612218

R. Yu. Simanchev, I. V. Urazova

Publication date: 3 January 2011

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

zbMATH Keywords

integer-valued modelschedules' convex hulltotal service time minimization

Mathematics Subject Classification ID

Related Items (3)

The affine hull of the schedule polytope for servicing identical requests by parallel devices ⋮ Comparison and polyhedral properties of valid inequalities for a polytope of schedules for servicing identical requests ⋮ On facet-inducing inequalities for combinatorial polytopes

Cites Work

• An exact algorithm for the identical parallel machine scheduling problem.
• Unnamed Item

This page was built for publication: An integer-valued model for the problem of minimizing the total servicing time of unit claims with parallel devices with precedences