A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint (Q2672605): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114129111, #quickstatements; #temporary_batch_1707232231678
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank

Revision as of 08:03, 5 March 2024

scientific article
Language Label Description Also known as
English
A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint
scientific article

    Statements

    A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint (English)
    0 references
    0 references
    0 references
    0 references
    13 June 2022
    0 references
    parallel two-stage flowshops
    0 references
    makespan constraint
    0 references
    polynomial-time approximation scheme
    0 references
    multiple knapsacks
    0 references
    rounding
    0 references

    Identifiers