Skip navigation
Please use this identifier to cite or link to this item: https://libeldoc.bsuir.by/handle/123456789/7814
Title: Scheduling incompatible tasks on two machines
Authors: Lushchakova, I. N.
Strusevich, V. A.
Keywords: публикации ученых
incompatibility graph
max-batch
polynomial algorithm
two machine scheduling
Issue Date: 2010
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.
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.
URI: http://libeldoc.bsuir.by/handle/123456789/7814
https://libeldoc.bsuir.by/handle/123456789/7814
Appears in Collections:Публикации в изданиях других стран

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


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