Worst-case analysis of an approximation algorithm for flow-shop scheduling (Q1121778): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-6377(89)90045-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001516562 / rank
 
Normal rank

Latest revision as of 10:34, 30 July 2024

scientific article
Language Label Description Also known as
English
Worst-case analysis of an approximation algorithm for flow-shop scheduling
scientific article

    Statements

    Worst-case analysis of an approximation algorithm for flow-shop scheduling (English)
    0 references
    0 references
    0 references
    1989
    0 references
    worst-case analysis
    0 references
    m-machine permutation flow-shop problem
    0 references
    tight worst-case performance ratio
    0 references

    Identifiers