On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints (Q1785422): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.orl.2015.07.008 / 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.1016/j.orl.2015.07.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1090409710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Competitiveness of On-Line Assignments / 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: The hierarchical model for load balancing on two machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online hierarchical scheduling problems with buffer or rearrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling on a small number of hierarchical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive online scheduling: Optimal algorithms for all speeds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online preemptive scheduling: one algorithm for all variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online and semi-online hierarchical scheduling for load balancing on uniform machines / 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 POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling under a grade of service provision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on parallel machines with two goS levels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal online algorithms for scheduling on two identical machines under a grade of service / 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: Improved bounds for online scheduling with eligibility constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling problems on two uniform machines under a grade of service provision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online and semi-online scheduling of two machines under a grade of service provision / 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: Optimal algorithms for semi-online machine covering on two hierarchical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal online algorithms on two hierarchical machines with tightly-grouped processing times / 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.ORL.2015.07.008 / rank
 
Normal rank

Latest revision as of 11:34, 11 December 2024

scientific article
Language Label Description Also known as
English
On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints
scientific article

    Statements

    On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints (English)
    0 references
    0 references
    28 September 2018
    0 references
    online scheduling
    0 references
    grade of service eligibility
    0 references
    competitive ratio
    0 references
    linear programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references