Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time (Q2926062)
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: Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time |
scientific article; zbMATH DE number 6362445
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time |
scientific article; zbMATH DE number 6362445 |
Statements
Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time (English)
0 references
29 October 2014
0 references
single machine scheduling
0 references
weighted shortest remaining processing time
0 references
WSRPT rule
0 references
efficient heuristic
0 references
0 references
0 references
0 references
0 references
