DC Field | Value | Language |
dc.contributor.author | Egorova, N. G. | - |
dc.contributor.author | Sotskov, Y. N. | - |
dc.date.accessioned | 2016-11-28T11:44:07Z | - |
dc.date.accessioned | 2017-07-27T12:26:49Z | - |
dc.date.available | 2016-11-28T11:44:07Z | - |
dc.date.available | 2017-07-27T12:26:49Z | - |
dc.date.issued | 2014 | - |
dc.identifier.citation | Egorova, N. G. Stability polyhedra of optimal permutation of jobs servicing / N. G. Egorova, Y. N. Sotskov // Automation and Remote Control. – 2014. – Vol. 75, № 7. – P. 1267–1282. | ru_RU |
dc.identifier.uri | https://libeldoc.bsuir.by/handle/123456789/10391 | - |
dc.description.abstract | Consideration was given to minimization of the sum of weighted instants of completing servicing of n customers by a single server, provided that the duration of jobs servicing may assume any real value from a given numerical interval. An algorithm of complexity O(n) was developed to construct a polyhedron (parallelepiped) of the optimality of permutation of servicing of n jobs that is contained in the domain of stability of the same permutation and comprises the polyhedron of its stability. | ru_RU |
dc.language.iso | en | ru_RU |
dc.publisher | MAIK Nauka | ru_RU |
dc.subject | публикации ученых | ru_RU |
dc.subject | одностадийное обслуживания требований | ru_RU |
dc.subject | неопределенность длительностей обслуживания требований | ru_RU |
dc.subject | многогранник оптимальности | ru_RU |
dc.subject | многогранник устойчивости | ru_RU |
dc.subject | single-machine scheduling | ru_RU |
dc.subject | uncertain processing times | ru_RU |
dc.subject | stability box | ru_RU |
dc.subject | optimality box | ru_RU |
dc.title | Stability polyhedra of optimal permutation of jobs servicing | ru_RU |
dc.type | Article | ru_RU |
Appears in Collections: | Публикации в зарубежных изданиях
|