| DC Field | Value | Language |
|---|
| dc.contributor.author | Lushchakova, I. N. | - |
| dc.contributor.author | Strusevich, V. A. | - |
| dc.date.accessioned | 2016-06-27T11:50:21Z | - |
| dc.date.accessioned | 2017-07-27T12:12:38Z | - |
| dc.date.available | 2016-06-27T11:50:21Z | - |
| dc.date.available | 2017-07-27T12:12:38Z | - |
| dc.date.issued | 2010 | - |
| dc.identifier.citation | Lushchakova, I. N. Scheduling incompatible tasks on two machines / I. N. Lushchakova, V. A. Strusevich // European Journal of Operational Research. - 2010. - № 200 (2). - Рp. 334-346. | ru_RU |
| dc.identifier.uri | https://libeldoc.bsuir.by/handle/123456789/7814 | - |
| dc.description.abstract | The paper studies the problem of scheduling tasks on two machines to minimize the makespan. The tasks are assigned to the machine in advance. An incompatibility relation is defined over the tasks which forbids any two incompatible tasks to be processed at the same time. The problem can serve as a mathematical model for some batching problems in which the jobs are grouped in pairs on two machines. A linear-time algorithm is presented. © 2009 Elsevier B.V. All rights reserved. | ru_RU |
| dc.language.iso | en | ru_RU |
| dc.subject | публикации ученых | ru_RU |
| dc.subject | incompatibility graph | ru_RU |
| dc.subject | max-batch | ru_RU |
| dc.subject | polynomial algorithm | ru_RU |
| dc.subject | two machine scheduling | ru_RU |
| dc.title | Scheduling incompatible tasks on two machines | ru_RU |
| dc.type | Article | ru_RU |
| Appears in Collections: | Публикации в зарубежных изданиях
|
