Volume 21, No 4, 2014, P. 89-101

UDC 519.1
R. Yu. Simanchev and N. Yu. Shereshik
Integer models for the interrupt-oriented services of jobs by single machine

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.

Simanchev Ruslan Yurievich 1
Shereshik NikolayYurievich 2

1. Complex Scientific Research Department of Regional Problems OSC, SB RAS,
15 K. Marx Ave., 644010 Omsk, Russia
2. Omsk branch of Sobolev Institute of Mathematics, SB RAS,
13 Pevtsov St., 644043 Omsk, Russia
e-mail: osiman@rambler.ru, m-m_pikm@mail.ru

 © Sobolev Institute of Mathematics, 2015