Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines
| Autor: | Irina N. Lushchakova |
|---|---|
| Jazyk: | angličtina |
| Předmět: |
Rate-monotonic scheduling
Uniform machines ComputingMilieux_THECOMPUTINGPROFESSION Scheduling Applied Mathematics Preemption Equal length jobs Polynomial algorithm Flow shop scheduling Dynamic priority scheduling Parallel computing Multiprocessor scheduling Fair-share scheduling Theoretical Computer Science Scheduling (computing) Fixed-priority pre-emptive scheduling Computational Theory and Mathematics Mathematics |
| Zdroj: | Discrete Optimization. (4):446-460 |
| ISSN: | 1572-5286 |
| DOI: | 10.1016/j.disopt.2009.05.005 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|