| DC Field | Value | Language |
|---|
| dc.contributor.author | Lushchakova, I. N. | - |
| dc.contributor.author | Kravchenko, S. A. | - |
| dc.date.accessioned | 2016-06-27T12:14:48Z | - |
| dc.date.accessioned | 2017-07-17T12:09:19Z | - |
| dc.date.available | 2016-06-27T12:14:48Z | - |
| dc.date.available | 2017-07-17T12:09:19Z | - |
| dc.date.issued | 1998 | - |
| dc.identifier.citation | Lushchakova, I. N. Two-machine shop scheduling with zero and unit processing times / I. N. Lushchakova, S. A. Kravchenko // European Journal of Operational Research. – 1998. – №107 (2). – Р. 378–388. | ru_RU |
| dc.identifier.uri | https://libeldoc.bsuir.by/handle/123456789/7817 | - |
| dc.description.abstract | We consider the two machine flow shop and open shop problems to minimize the weighted mean flow-time, processing times being equal to 0 or 1. The solution to the open shop problem is based on algorithms for the flow shop problem and the corresponding two parallel identical machine problem. For all problems O(n log n) algorithms are proposed. © 1998 Elsevier Science B.V. All rights reserved. | ru_RU |
| dc.language.iso | ru | ru_RU |
| dc.subject | публикации ученых | ru_RU |
| dc.subject | flow shop | ru_RU |
| dc.subject | open shop | ru_RU |
| dc.subject | optimal schedule | ru_RU |
| dc.subject | polynomial algorithm | ru_RU |
| dc.title | Two-machine shop scheduling with zero and unit processing times | ru_RU |
| dc.type | Article | ru_RU |
| Appears in Collections: | Публикации в зарубежных изданиях
|
