General parametric scheme for the online uniform machine scheduling problem with two different speeds (Q1707972): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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.2018.01.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2787036914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling on two uniform processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with reassignment on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for online uniform-machine scheduling to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for List Schedules on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2833437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with rearrangement on two related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for bin stretching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for semi-online multiprocessor scheduling with given total processing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on two uniform machines subject to eligibility constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An On-Line Algorithm for Some Uniform Processor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on two uniform machines to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with one rearrangement at the end: revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive on-line scheduling for two uniform processors / rank
 
Normal rank

Latest revision as of 10:27, 15 July 2024

scientific article
Language Label Description Also known as
English
General parametric scheme for the online uniform machine scheduling problem with two different speeds
scientific article

    Statements

    General parametric scheme for the online uniform machine scheduling problem with two different speeds (English)
    0 references
    0 references
    0 references
    0 references
    4 April 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    online algorithms
    0 references
    scheduling
    0 references
    0 references