Skip navigation
Please use this identifier to cite or link to this item: https://libeldoc.bsuir.by/handle/123456789/7814
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLushchakova, I. N.-
dc.contributor.authorStrusevich, V. A.-
dc.date.accessioned2016-06-27T11:50:21Z-
dc.date.accessioned2017-07-27T12:12:38Z-
dc.date.available2016-06-27T11:50:21Z-
dc.date.available2017-07-27T12:12:38Z-
dc.date.issued2010-
dc.identifier.citationLushchakova, 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.urihttp://libeldoc.bsuir.by/handle/123456789/7814-
dc.identifier.urihttps://libeldoc.bsuir.by/handle/123456789/7814-
dc.description.abstractThe 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.isoenru_RU
dc.subjectпубликации ученыхru_RU
dc.subjectincompatibility graphru_RU
dc.subjectmax-batchru_RU
dc.subjectpolynomial algorithmru_RU
dc.subjecttwo machine schedulingru_RU
dc.titleScheduling incompatible tasks on two machinesru_RU
dc.typeArticleru_RU
Appears in Collections:Публикации в изданиях других стран

Files in This Item:
File Description SizeFormat 
241003.pdf319,79 kBAdobe PDFView/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.