The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost (Q297182)

From MaRDI portal
Revision as of 06:18, 12 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
The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
scientific article

    Statements

    The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost (English)
    0 references
    0 references
    24 June 2016
    0 references
    batch scheduling
    0 references
    bicriteria scheduling
    0 references
    rejection
    0 references
    total completion time
    0 references
    0 references
    0 references

    Identifiers