Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (Q2314063): 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.1007/s40305-018-0192-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2792565375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations / 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: Minimizing makespan in batch machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / 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: Approximation algorithms in batch processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line algorithms for minimizing makespan on 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: An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing 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: A best online algorithm for scheduling on two parallel batch machines / 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: Online scheduling on unbounded parallel-batch machines to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling in a parallel batch processing system to minimize makespan using restarts / 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: Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling a batch processing system to minimize total weighted job completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan / 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: On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on unbounded parallel-batch machines with incompatible job families / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling with delivery time on a single batch machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best semi-online algorithms for unbounded parallel batch scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online over time scheduling on parallel-batch machines: a survey / rank
 
Normal rank

Latest revision as of 23:37, 19 July 2024

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

    Statements

    Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 July 2019
    0 references
    0 references
    online scheduling
    0 references
    uniform parallel-batch machines
    0 references
    makespan
    0 references
    competitive ratio
    0 references
    0 references
    0 references