Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines - MaRDI portal

Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (Q4578168)

From MaRDI portal
scientific article; zbMATH DE number 6914630
Language Label Description Also known as
English
Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines
scientific article; zbMATH DE number 6914630

    Statements

    title
    Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (English)
    0 references
    publication date
    8 August 2018
    0 references
    zbMATH Keywords
    scheduling
    0 references
    parallel machine
    0 references
    approximation
    0 references
    cites work
    Q2712370
    0 references

    Identifiers

    DOI
    10.1051/ro/2017044
    0 references
    Mathematics Subject Classification ID
    90B35
    0 references
    90C59
    0 references
    90C39
    0 references
    zbMATH DE Number
    6914630
    0 references
    OpenAlex ID
    W2620541949
    0 references
    Wikidata QID
    Q59228840
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4578168&oldid=36413711"
    Powered by MediaWiki