Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time (Q2926062): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/10556788.2013.854360 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2037005161 / rank | |||
Normal rank | |||
Revision as of 00:21, 20 March 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
