A Computational Study of the Job-Shop Scheduling Problem (Q4025904)

From MaRDI portal
Revision as of 04:55, 3 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56698006, #quickstatements; #temporary_batch_1712111774907)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Computational Study of the Job-Shop Scheduling Problem
scientific article

    Statements

    A Computational Study of the Job-Shop Scheduling Problem (English)
    0 references
    0 references
    0 references
    0 references
    18 February 1993
    0 references
    0 references
    job-shop scheduling
    0 references
    heuristic procedure
    0 references
    cutting-plane method
    0 references
    lower bounds
    0 references
    branch and bound
    0 references
    0 references
    0 references