A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (Q2434249)

From MaRDI portal
Revision as of 08:30, 7 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
scientific article

    Statements

    A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (English)
    0 references
    0 references
    0 references
    5 February 2014
    0 references
    0 references
    bicriteria scheduling
    0 references
    due date assignment
    0 references
    convex controllable processing times
    0 references
    resource allocation
    0 references
    0 references
    0 references
    0 references