Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan (Q656603): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.2010.04.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041764641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling on identical machines: How good is LPT in an on-line setting? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms in batch processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling on a batch machine to minimize makespan with limited restarts / 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: An optimal online algorithm for scheduling two machines with release times / 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: Minimizing makespan in batch machine scheduling / 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: A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan / 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 21:11, 4 July 2024

scientific article
Language Label Description Also known as
English
Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan
scientific article

    Statements

    Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan (English)
    0 references
    0 references
    18 January 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    online scheduling
    0 references
    parallel-batching machines
    0 references
    limited restart
    0 references
    competitive ratio
    0 references
    0 references