An exact algorithm for the preemptive single machine scheduling of equal-length jobs (Q2147002)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An exact algorithm for the preemptive single machine scheduling of equal-length jobs |
scientific article; zbMATH DE number 7546500
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact algorithm for the preemptive single machine scheduling of equal-length jobs |
scientific article; zbMATH DE number 7546500 |
Statements
An exact algorithm for the preemptive single machine scheduling of equal-length jobs (English)
0 references
22 June 2022
0 references
preemptive scheduling
0 references
total weighted completion time
0 references
equal processing times
0 references
branch and bound
0 references
heuristic
0 references
benchmark
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8505238890647888
0 references
0.8456736207008362
0 references
0.8277696967124939
0 references
0.8091594576835632
0 references
