An optimal online algorithm for single machine scheduling to minimize total general completion time (Q421265): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57185658, #quickstatements; #temporary_batch_1714786519576 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4223058 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A class of on-line scheduling algorithms to minimize total completion time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing the total completion time on-line on a single machine, using restarts / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4368485 / rank | |||
Normal rank | |||
Revision as of 06:07, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal online algorithm for single machine scheduling to minimize total general completion time |
scientific article |
Statements
An optimal online algorithm for single machine scheduling to minimize total general completion time (English)
0 references
23 May 2012
0 references
online scheduling
0 references
total general completion time
0 references
competitive analysis
0 references
