RUS  ENG
Full version
JOURNALS // Diskretnyi Analiz i Issledovanie Operatsii // Archive

Diskretn. Anal. Issled. Oper., 2014 Volume 21, Issue 4, Pages 89–101 (Mi da788)

This article is cited in 3 papers

Integer models for the interrupt-oriented services of jobs by single machine

R. Yu. Simancheva, N. Yu. Shereshikb

a Complex Scientific Research Department of Regional Problems OSC, SB RAS, 15 K. Marx Ave., 644010 Omsk, Russia
b Omsk branch of Sobolev Institute of Mathematics, SB RAS, 13 Pevtsov St., 644043 Omsk, Russia

Abstract: We consider the problem of minimizing the total service time of different jobs from one device preemption. We describe three linear integer programming models for the problem. Comparative study of the models and a simulation experiment are also described. Tab. 1, ill. 6, bibliogr. 7.

Keywords: combinatorial optimization, polyhedral cone, polytope, subgraph.

UDC: 519.1

Received: 13.03.2014
Revised: 07.05.2014



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024