Please use this identifier to cite or link to this item:
https://libeldoc.bsuir.by/handle/123456789/7817
| Title: | Two-machine shop scheduling with zero and unit processing times |
| Keywords: | публикации ученых;flow shop;open shop;optimal schedule;polynomial algorithm |
| Issue Date: | 1998 |
| 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, 107 (2). – 1998. - Рp. 378-388. |
| 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. |
| URI: | https://libeldoc.bsuir.by/handle/123456789/7817 |
| Appears in Collections: | Публикации в зарубежных изданиях
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
