A note on a single-machine lot scheduling problem with indivisible orders (Q1652143)

From MaRDI portal
Revision as of 18:04, 24 July 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 note on a single-machine lot scheduling problem with indivisible orders
scientific article

    Statements

    A note on a single-machine lot scheduling problem with indivisible orders (English)
    0 references
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    lot scheduling
    0 references
    single machine
    0 references
    total completion time
    0 references
    indivisible order
    0 references
    integer programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references