|
Diskretnyi Analiz i Issledovanie Operatsii, 2011, Volume 18, Issue 1, Pages 85–97
(Mi da641)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Scheduling unit-time jobs on parallel processors polytope
R. Yu. Simanchev, I. V. Urazova Omsk State University, Omsk, Russia
Abstract:
The polytope of scheduling unit-time jobs on identical parallel machines is studied. In addition, we consider LP relaxation and describe the class supporting inequalities for this polytope. We claim that obtained inequalities can be used as cutting planes for integer programming. We discuss the identification problem of these inequalities for the given nonintegral point. Il. 1, tabl. 1, bibliogr. 5.
Keywords:
scheduling problems, precedence, integer programming, polytope, supporting inequality.
Received: 03.11.2009 Revised: 06.12.2010
Citation:
R. Yu. Simanchev, I. V. Urazova, “Scheduling unit-time jobs on parallel processors polytope”, Diskretn. Anal. Issled. Oper., 18:1 (2011), 85–97
Linking options:
https://www.mathnet.ru/eng/da641 https://www.mathnet.ru/eng/da/v18/i1/p85
|
|