An optimal online algorithm for single machine scheduling to minimize total general completion time (Q421265): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-010-9348-0 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-010-9348-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050357462 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57185658 / 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 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
Property / DOI
 
Property / DOI: 10.1007/S10878-010-9348-0 / rank
 
Normal rank

Latest revision as of 17:04, 9 December 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
    0 references
    0 references
    0 references
    0 references
    23 May 2012
    0 references
    online scheduling
    0 references
    total general completion time
    0 references
    competitive analysis
    0 references

    Identifiers