Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time (Q1944164): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2011.06.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2073731934 / rank
 
Normal rank
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: Minimizing makespan on a single batch processing machine with dynamic job arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines / 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: Minimizing makespan in batch machine scheduling / 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: Online scheduling on unbounded parallel-batch machines to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line algorithms for minimizing makespan on batch processing machines / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:40, 6 July 2024

scientific article
Language Label Description Also known as
English
Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
scientific article

    Statements

    Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time (English)
    0 references
    0 references
    0 references
    4 April 2013
    0 references
    online algorithms
    0 references
    scheduling
    0 references
    parallel-batch machines
    0 references
    maximum flow-time
    0 references
    competitive ratio
    0 references

    Identifiers