A no-delay single machine scheduling problem to minimize total weighted early and late work (Q6063508)

From MaRDI portal
Revision as of 18:05, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 7762292
Language Label Description Also known as
English
A no-delay single machine scheduling problem to minimize total weighted early and late work
scientific article; zbMATH DE number 7762292

    Statements

    A no-delay single machine scheduling problem to minimize total weighted early and late work (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 November 2023
    0 references
    single machine scheduling
    0 references
    early and late work
    0 references
    general variable neighborhood search
    0 references
    GRASP-VND
    0 references
    0-1 integer programming
    0 references

    Identifiers