Online scheduling of incompatible unit-length job families with lookahead (Q2250449): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2014.05.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977081351 / 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: Approximation algorithms in batch processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Batch Loading and Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan / 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: Q3995531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: A look-ahead heuristic for scheduling jobs with release dates on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unit length jobs on parallel machines with lookahead information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times / 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: Best semi-online algorithms for unbounded parallel batch scheduling / 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: How much can lookahead help in online single machine scheduling / rank
 
Normal rank

Latest revision as of 18:14, 8 July 2024

scientific article
Language Label Description Also known as
English
Online scheduling of incompatible unit-length job families with lookahead
scientific article

    Statements

    Online scheduling of incompatible unit-length job families with lookahead (English)
    0 references
    0 references
    0 references
    0 references
    7 July 2014
    0 references
    0 references
    online algorithm
    0 references
    parallel-batch scheduling
    0 references
    incompatible job families
    0 references
    makespan
    0 references
    competitive ratio
    0 references
    0 references