An optimal online algorithm for single machine scheduling to minimize total general completion time (Q421265): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Ming Liu / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6038105 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
online scheduling | |||
| Property / zbMATH Keywords: online scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
total general completion time | |||
| Property / zbMATH Keywords: total general completion time / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
competitive analysis | |||
| Property / zbMATH Keywords: competitive analysis / rank | |||
Normal rank | |||
Revision as of 20:44, 29 June 2023
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
