A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness (Q4666773)

From MaRDI portal
Revision as of 19:14, 7 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2153040
Language Label Description Also known as
English
A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness
scientific article; zbMATH DE number 2153040

    Statements

    A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness (English)
    0 references
    0 references
    0 references
    5 April 2005
    0 references
    flowshop-scheduling problem
    0 references
    branch-and-bound algorithm
    0 references

    Identifiers