A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time'' (Q763490): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Sheng Yu / rank | |||
| Property / author | |||
| Property / author: Sheng Yu / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2011.09.014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2085352696 / rank | |||
Normal rank | |||
| 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 average completion time in the presence of release dates / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4223483 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:22, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time'' |
scientific article |
Statements
A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time'' (English)
0 references
9 March 2012
0 references
online algorithms
0 references
scheduling
0 references
total general completion time
0 references
delayed shortest processing time
0 references
competitive analysis
0 references
