Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection (Q2215189)

From MaRDI portal
Revision as of 18:41, 1 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
Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection
scientific article

    Statements

    Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection (English)
    0 references
    0 references
    11 December 2020
    0 references
    scheduling
    0 references
    batch processing
    0 references
    job rejection
    0 references
    approximation algorithm
    0 references
    performance analysis
    0 references

    Identifiers