| DC Field | Value | Language |
|---|
| dc.date.accessioned | 2016-06-27T11:32:01Z | - |
| dc.date.accessioned | 2017-07-27T12:12:38Z | - |
| dc.date.available | 2016-06-27T11:32:01Z | - |
| dc.date.available | 2017-07-27T12:12:38Z | - |
| dc.date.issued | 2012 | - |
| dc.identifier.citation | Lushchakova, I. N. Preemptive scheduling of two uniform parallel machines to minimize total tardiness / I. N. Lushchakova // European Journal of Operational Research, 219 (1). - 2012 - Рp. 27 - 33. | ru_RU |
| dc.identifier.uri | https://libeldoc.bsuir.by/handle/123456789/7813 | - |
| dc.description.abstract | We consider the problem of preemptive scheduling n jobs on two uniform
parallel machines. All jobs have equal processing requirements. For each job we
are given its due date. The objective is to find a schedule minimizing total
tardiness ∑ Ti. We suggest an O(n log n) algorithm to solve this problem. | ru_RU |
| dc.language.iso | ru | ru_RU |
| dc.publisher | БГУИР | ru_RU |
| dc.subject | публикации ученых | ru_RU |
| dc.subject | polynomial algorithm | ru_RU |
| dc.subject | scheduling | ru_RU |
| dc.subject | total tardiness | ru_RU |
| dc.subject | uniform machines | ru_RU |
| dc.subject | due dates | ru_RU |
| dc.subject | polynomial algorithm | ru_RU |
| dc.subject | pre-emptive scheduling | ru_RU |
| dc.subject | total tardiness | ru_RU |
| dc.subject | uniform machine | ru_RU |
| dc.subject | uniform parallel machines | ru_RU |
| dc.subject | mathematical models | ru_RU |
| dc.subject | operations research | ru_RU |
| dc.subject | scheduling | ru_RU |
| dc.subject | scheduling algorithms | ru_RU |
| dc.title | Preemptive scheduling of two uniform parallel machines to minimize total tardiness | ru_RU |
| dc.type | Article | ru_RU |
| Appears in Collections: | Публикации в зарубежных изданиях
|
