A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops (Q1260741): 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/0305-0548(93)90083-u / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981936740 / rank
 
Normal rank

Latest revision as of 11:59, 30 July 2024

scientific article
Language Label Description Also known as
English
A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
scientific article

    Statements

    A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops (English)
    0 references
    0 references
    25 August 1993
    0 references
    0 references
    two-machine flowshop scheduling
    0 references
    lower bounds
    0 references
    branch and bound
    0 references
    0 references