Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (Q1011298)

From MaRDI portal
Revision as of 12:45, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing lower and upper bounds for a large-scale industrial job shop scheduling problem
scientific article

    Statements

    Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    8 April 2009
    0 references
    scheduling
    0 references
    batching
    0 references
    tabu search
    0 references
    mathematical programming
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers