Fast approximation algorithms for uniform machine scheduling with processing set restrictions (Q1753462): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2017.01.013 / rank
Normal rank
 
Property / cites work
 
Property / cites work: On-Line Load Balancing in a Hierarchical Server Topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on uniform machines with two hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithms for job scheduling with processing set restrictions / 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: Makespan minimization in online scheduling with machine eligibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with equal processing times subject to machine eligibility constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling parallel machines with inclusive processing set restrictions and job release times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for online scheduling with eligibility constraints / 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: Scheduling parallel machines with inclusive processing set restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal rounding gives a better approximation for scheduling unrelated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on hierarchical scheduling on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online hierarchical scheduling: an approach using mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with equal processing times and machine eligibility constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online parallel machines scheduling with two hierarchies / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2017.01.013 / rank
 
Normal rank

Latest revision as of 08:20, 11 December 2024

scientific article
Language Label Description Also known as
English
Fast approximation algorithms for uniform machine scheduling with processing set restrictions
scientific article

    Statements

    Fast approximation algorithms for uniform machine scheduling with processing set restrictions (English)
    0 references
    0 references
    29 May 2018
    0 references
    scheduling
    0 references
    uniform machines
    0 references
    inclusive processing set
    0 references
    tree-hierarchical processing set
    0 references
    makespan
    0 references
    worst-case bound
    0 references

    Identifiers