|
This article is cited in 1 scientific paper (total in 1 paper)
Relaxations for the polyhedron of optimal schedules for the problem of interrupt-oriented service of jobs with a single machine
N. Yu. Shereshik Omsk State University, 55-a Mir Ave., 644077 Omsk, Russia
Abstract:
We consider the problem of minimizing the total service time of different jobs from one device preemption. We construct two classes of hyperplanes containing polyhedron of optimal schedules for this problem and describe computer experiments. Ill. 4, tab. 1, bibliogr. 6.
Keywords:
scheduling theory, integer programming model, polytope, polyhedron, valid inequality, relaxation.
Received: 11.04.2015 Revised: 16.08.2015
Citation:
N. Yu. Shereshik, “Relaxations for the polyhedron of optimal schedules for the problem of interrupt-oriented service of jobs with a single machine”, Diskretn. Anal. Issled. Oper., 22:6 (2015), 78–90
Linking options:
https://www.mathnet.ru/eng/da834 https://www.mathnet.ru/eng/da/v22/i6/p78
|
Statistics & downloads: |
Abstract page: | 197 | Full-text PDF : | 75 | References: | 32 | First page: | 3 |
|