Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart (Q2250440): 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.tcs.2014.05.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991510296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restarts can help in the on-line minimization of the maximum delivery time on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms in batch processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for on-line single-machine scheduling. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal on-line algorithms for one batch machine with grouped processing times / 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: On-line scheduling on a batch machine to minimize makespan with limited restarts / 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 single machine: Maximizing the number of early jobs / 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 of equal length jobs on unbounded parallel batch processing machines with limited restart / 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: On-line scheduling algorithms for a batch machine with finite capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the total completion time on-line on a single machine, using restarts / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:14, 8 July 2024

scientific article
Language Label Description Also known as
English
Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart
scientific article

    Statements

    Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart (English)
    0 references
    0 references
    0 references
    7 July 2014
    0 references
    online scheduling
    0 references
    restart
    0 references
    limited restart
    0 references
    unit length jobs
    0 references
    restricted batch
    0 references

    Identifiers