A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates (Q2430605)

From MaRDI portal
Revision as of 12:40, 4 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
scientific article

    Statements

    A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates (English)
    0 references
    0 references
    0 references
    0 references
    8 April 2011
    0 references
    0 references
    scheduling
    0 references
    single machine
    0 references
    controllable processing times
    0 references
    convex resource consumption function
    0 references