| DC Field | Value | Language |
|---|
| dc.contributor.author | Lushchakova, I. N. | - |
| dc.date.accessioned | 2016-06-27T11:56:54Z | - |
| dc.date.accessioned | 2017-07-17T12:09:20Z | - |
| dc.date.available | 2016-06-27T11:56:54Z | - |
| dc.date.available | 2017-07-17T12:09:20Z | - |
| dc.date.issued | 2009 | - |
| dc.identifier.citation | Lushchakova, I. N. Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines / I. N. Lushchakova // Discrete Optimization, 6 (4). - 2009. - Рp. 446-460. | ru_RU |
| dc.identifier.uri | https://libeldoc.bsuir.by/handle/123456789/7815 | - |
| dc.description.abstract | We consider a problem of scheduling n jobs on two uniform parallel machines. For each job we are given its release date when the job becomes available for processing. All jobs have equal processing requirements. Preemptions are allowed. The objective is to find a schedule minimizing total completion time. We suggest an O (n3) algorithm to solve this problem. © 2009 Elsevier B.V. All rights reserved. | ru_RU |
| dc.language.iso | en | ru_RU |
| dc.subject | публикации ученых | ru_RU |
| dc.subject | equal length jobs | ru_RU |
| dc.subject | polynomial algorithm | ru_RU |
| dc.subject | scheduling | ru_RU |
| dc.subject | uniform machines | ru_RU |
| dc.title | Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines | ru_RU |
| dc.type | Article | ru_RU |
| Appears in Collections: | Публикации в зарубежных изданиях
|
