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

From MaRDI portal
Import241208061232 (talk | contribs)
Normalize DOI.
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2022.04.044 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2022.04.044 / rank
 
Normal rank

Latest revision as of 16:11, 19 December 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