Semi-on-line multiprocessor scheduling with given total processing time (Q557814): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:37, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semi-on-line multiprocessor scheduling with given total processing time |
scientific article |
Statements
Semi-on-line multiprocessor scheduling with given total processing time (English)
0 references
30 June 2005
0 references
In the paper, a classical multiprocessor scheduling problem is considered. A set of independent jobs is to be processed on \(m\) parallel, identical machines in order to minimize the makespan. The jobs arrive on-line, i.e., each job must be immediately assigned to one of the machines. A modification assumed in the paper is the knowledge of a sum of processing times of tasks which are supposed to arrive. The authors propose a new approximation algorithm with performance ratio 1.6.
0 references
on-line algorithms
0 references
multiprocessor scheduling
0 references
approximation algorithms
0 references
