Improved bounds for online scheduling with eligibility constraints
From MaRDI portal
Publication:719259
DOI10.1016/J.TCS.2011.05.029zbMATH Open1233.90164OpenAlexW2031740584MaRDI QIDQ719259FDOQ719259
Authors: Kyungkuk Lim, Kangbok Lee, Soo Y. Chang 
Publication date: 10 October 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.05.029
Recommendations
- Online scheduling on two uniform machines subject to eligibility constraints
- Online scheduling with equal processing times and machine eligibility constraints
- An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints
- Makespan minimization in online scheduling with machine eligibility
- Makespan minimization in online scheduling with machine eligibility
Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- On-line scheduling revisited
- Title not available (Why is that?)
- The Competitiveness of On-Line Assignments
- Bounds for Certain Multiprocessing Anomalies
- Scheduling jobs with equal processing times subject to machine eligibility constraints
- A better lower bound for on-line scheduling
- Title not available (Why is that?)
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- New algorithms for an ancient scheduling problem.
- Coordination mechanisms with hybrid local policies
- Online algorithms: a survey
- On-line load balancing in a hierarchical server topology
- Parallel machine scheduling with job assignment restrictions
- Makespan minimization in online scheduling with machine eligibility
- Online and semi-online scheduling of two machines under a grade of service provision
- Online scheduling on parallel machines with two goS levels
- Parallel machine scheduling under a grade of service provision
- Scheduling parallel machines with inclusive processing set restrictions
- Better Bounds for Online Scheduling
- Improved Bounds for the Online Scheduling Problem
- New lower and upper bounds for on-line scheduling
- A Better Algorithm for an Ancient Scheduling Problem
- Scheduling parallel machines with inclusive processing set restrictions and job release times
- On-line load balancing
- Parallel machine scheduling with nested job assignment restrictions
- Parallel machine scheduling with nested processing set restrictions
- A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS
- Parallel machine scheduling of machine-dependent jobs with unit-length.
- Online hierarchical scheduling: an approach using mathematical programming
- A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions
- Online scheduling on two uniform machines subject to eligibility constraints
Cited In (15)
- Mixed coordination mechanisms for scheduling games on hierarchical machines
- Makespan minimization in online scheduling with machine eligibility
- Online scheduling with unit processing times and processing set restrictions
- Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs
- Fast approximation algorithms for uniform machine scheduling with processing set restrictions
- Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing
- Online scheduling with equal processing times and machine eligibility constraints
- On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints
- Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling
- Bin stretching with migration on two hierarchical machines
- Online scheduling to minimize modified total tardiness with an availability constraint
- Makespan minimization in online scheduling with machine eligibility
- Online scheduling with migration on two hierarchical machines
- An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
- A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS
This page was built for publication: Improved bounds for online scheduling with eligibility constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q719259)
