Improved bounds for online scheduling with eligibility constraints (Q719259): 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.2011.05.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031740584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Bounds for Online Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line load balancing / 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: A better lower bound for on-line scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for an ancient scheduling problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower and upper bounds for on-line scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3031924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with job assignment restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / 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: Parallel machine scheduling with nested processing set restrictions / 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: Online scheduling on parallel machines with two goS levels / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Better Algorithm for an Ancient Scheduling Problem / 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: Scheduling jobs with equal processing times subject to machine 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: Coordination mechanisms with hybrid local policies / 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: Parallel machine scheduling of machine-dependent jobs with unit-length. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with nested job assignment restrictions / 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: Online and semi-online scheduling of two machines under a grade of service provision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for the Online Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online hierarchical scheduling: an approach using mathematical programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:47, 4 July 2024

scientific article
Language Label Description Also known as
English
Improved bounds for online scheduling with eligibility constraints
scientific article

    Statements

    Improved bounds for online scheduling with eligibility constraints (English)
    0 references
    0 references
    0 references
    0 references
    10 October 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    online scheduling
    0 references
    parallel machines
    0 references
    eligibility constraints
    0 references
    greedy algorithm
    0 references
    competitive ratio
    0 references
    0 references
    0 references
    0 references
    0 references