Two-machine flowshop scheduling to minimize the number of tardy jobs (Q4367035)

From MaRDI portal
Revision as of 15:32, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article; zbMATH DE number 1091247
Language Label Description Also known as
English
Two-machine flowshop scheduling to minimize the number of tardy jobs
scientific article; zbMATH DE number 1091247

    Statements

    Two-machine flowshop scheduling to minimize the number of tardy jobs (English)
    0 references
    0 references
    0 references
    25 November 1997
    0 references
    two-machine flowshop
    0 references
    total number of tardy jobs
    0 references
    polynomially solvable special cases
    0 references
    heuristic
    0 references

    Identifiers