On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan (Q2482805)

From MaRDI portal
Revision as of 20:29, 28 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q1652151)
scientific article
Language Label Description Also known as
English
On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan
scientific article

    Statements

    On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan (English)
    0 references
    0 references
    0 references
    24 April 2008
    0 references
    batch processing machine
    0 references
    competitive analysis
    0 references

    Identifiers