Improved bounds for online scheduling with eligibility constraints
From MaRDI portal
(Redirected from Publication:719259)
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
Cites work
- scientific article; zbMATH DE number 4130003 (Why is no real title available?)
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- A Better Algorithm for an Ancient Scheduling Problem
- A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS
- A better lower bound for on-line scheduling
- A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- Better Bounds for Online Scheduling
- Bounds for Certain Multiprocessing Anomalies
- Coordination mechanisms with hybrid local policies
- Improved Bounds for the Online Scheduling Problem
- Makespan minimization in online scheduling with machine eligibility
- New algorithms for an ancient scheduling problem.
- New lower and upper bounds for on-line scheduling
- On-line load balancing
- On-line load balancing in a hierarchical server topology
- On-line scheduling revisited
- Online algorithms: a survey
- Online and semi-online scheduling of two machines under a grade of service provision
- Online hierarchical scheduling: an approach using mathematical programming
- Online scheduling on parallel machines with two goS levels
- Online scheduling on two uniform machines subject to eligibility constraints
- Parallel machine scheduling of machine-dependent jobs with unit-length.
- Parallel machine scheduling under a grade of service provision
- Parallel machine scheduling with job assignment restrictions
- Parallel machine scheduling with nested job assignment restrictions
- Parallel machine scheduling with nested processing set restrictions
- Scheduling jobs with equal processing times subject to machine eligibility constraints
- Scheduling parallel machines with inclusive processing set restrictions
- Scheduling parallel machines with inclusive processing set restrictions and job release times
- The Competitiveness of On-Line Assignments
Cited in
(15)- Mixed coordination mechanisms for scheduling games on hierarchical machines
- Online scheduling with unit processing times and processing set restrictions
- Makespan minimization in online scheduling with machine eligibility
- 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)
