Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times (Q626449): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1288472
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Yin-Feng Xu / 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.1007/s10878-009-9231-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041066538 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57185701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi on-line scheduling on two identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling under a grade of service provision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on parallel machines with two goS levels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal online algorithms for scheduling on two identical machines under a grade of service / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online and semi-online scheduling of two machines under a grade of service provision / rank
 
Normal rank

Latest revision as of 19:30, 3 July 2024

scientific article
Language Label Description Also known as
English
Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
scientific article

    Statements

    Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 February 2011
    0 references
    0 references
    makespan
    0 references
    competitive analysis
    0 references
    total processing time
    0 references
    0 references
    0 references