List scheduling algorithms to minimize the makespan on identical parallel machines (Q1348708)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1740554
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | List scheduling algorithms to minimize the makespan on identical parallel machines |
scientific article; zbMATH DE number 1740554 |
Statements
List scheduling algorithms to minimize the makespan on identical parallel machines (English)
0 references
14 May 2002
0 references
The problem of minimizing the makespan on parallel identical machines is considered. A popular technique for this problem is list scheduling, according to which the jobs are scanned in a certain order (the list) and the next job is assigned to the first available machine. Heuristic algorithms designed in this paper are of list scheduling type, however the rule for forming the list does not, stay unchanged but can be altered after having scheduled a certain number of jobs. Computational experiments reported in the paper demonstrate good performance of the algorithms of this nature.
0 references
parallel machine scheduling
0 references
list scheduling
0 references
heuristic algorithms
0 references
0 references
0 references
0.9018437
0 references
0.89716774
0 references
0.8965189
0 references
0.89521325
0 references
0.89054376
0 references
0 references
0.8893723
0 references
