Semi-online early work maximization problem on two hierarchical machines with partial information of processing time (Q2151369)

From MaRDI portal
Revision as of 00:37, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Semi-online early work maximization problem on two hierarchical machines with partial information of processing time
scientific article

    Statements

    Semi-online early work maximization problem on two hierarchical machines with partial information of processing time (English)
    0 references
    0 references
    0 references
    0 references
    1 July 2022
    0 references
    semi-online
    0 references
    early work
    0 references
    hierarchy
    0 references
    competitive ratio
    0 references

    Identifiers