The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan (Q596087)

From MaRDI portal
Revision as of 18:38, 6 June 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 unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
scientific article

    Statements

    The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan (English)
    0 references
    0 references
    10 August 2004
    0 references
    Scheduling
    0 references
    Family
    0 references
    Batching
    0 references
    Makespan
    0 references

    Identifiers