Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery (Q4689384)

From MaRDI portal
Revision as of 11:32, 7 October 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129727404, #quickstatements; #temporary_batch_1728295585747)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6954990
Language Label Description Also known as
English
Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery
scientific article; zbMATH DE number 6954990

    Statements

    Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery (English)
    0 references
    0 references
    0 references
    16 October 2018
    0 references
    scheduling
    0 references
    incompatible family jobs
    0 references
    online algorithm
    0 references
    competitive ratio
    0 references

    Identifiers