Online scheduling on unbounded parallel-batch machines to minimize the makespan (Q990962): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Control of a batch-processing machine: A computational approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms in batch processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A best online algorithm for scheduling on two parallel batch machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on a single batch processing machine with dynamic job arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling one batch processor subject to job release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A flexible on-line scheduling algorithm for batch machine with infinite capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling algorithms for a batch machine with finite capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line algorithms for minimizing makespan on batch processing machines / rank
 
Normal rank

Latest revision as of 04:17, 3 July 2024

scientific article
Language Label Description Also known as
English
Online scheduling on unbounded parallel-batch machines to minimize the makespan
scientific article

    Statements

    Online scheduling on unbounded parallel-batch machines to minimize the makespan (English)
    0 references
    0 references
    1 September 2010
    0 references
    0 references
    algorithms
    0 references
    online scheduling
    0 references
    parallel-batch machines
    0 references
    makespan
    0 references
    competitive ratio
    0 references
    0 references