A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints (Q3636717)

From MaRDI portal
Revision as of 00:34, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints
scientific article

    Statements

    A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints (English)
    0 references
    0 references
    0 references
    29 June 2009
    0 references
    scheduling
    0 references
    two-machine flowshop
    0 references
    limited waiting time
    0 references
    makespan
    0 references

    Identifiers