Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time (Q2926062): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 21:14, 3 February 2024
scientific article
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 |
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