Online C-benevolent job scheduling on multiple machines (Q1744621): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-017-1191-0 / rank
Normal rank
 
Property / author
 
Property / author: Jacobson, Sheldon H. / rank
Normal rank
 
Property / author
 
Property / author: Jacobson, Sheldon H. / rank
 
Normal rank
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/s11590-017-1191-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2754548199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with fixed start and end times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Throughput of Multiple Machines in Real-Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the competitiveness of on-line real-time task scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online real-time preemptive scheduling of jobs with deadlines on multiple machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling of jobs with fixed start times on related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved randomized results for the interval selection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for scheduling on uniformly related and identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval selection: Applications, algorithms, and lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on scheduling intervals on-line / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of equal-length intervals on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online interval scheduling: Randomized and multiprocessor cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved randomized online scheduling of intervals and jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed interval scheduling: models, applications, computational complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval scheduling on related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved randomized on-line algorithm for a weighted interval selection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized online interval scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of jobs with fixed start and end times / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-017-1191-0 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:47, 11 December 2024

scientific article
Language Label Description Also known as
English
Online C-benevolent job scheduling on multiple machines
scientific article

    Statements

    Online C-benevolent job scheduling on multiple machines (English)
    0 references
    0 references
    0 references
    19 April 2018
    0 references
    online scheduling
    0 references
    C-benevolent jobs
    0 references
    approximation algorithm
    0 references

    Identifiers