Online scheduling on parallel machines with two goS levels
From MaRDI portal
Publication:941832
DOI10.1007/S10878-007-9095-ZzbMath1176.90221OpenAlexW2073932525MaRDI QIDQ941832
Publication date: 2 September 2008
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-007-9095-z
Related Items (30)
Total completion time minimization in online hierarchical scheduling of unit-size jobs ⋮ Online parallel machines scheduling with two hierarchies ⋮ OPTIMAL ONLINE ALGORITHMS ON TWO HIERARCHICAL MACHINES WITH RESOURCE AUGMENTATION ⋮ On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines ⋮ A note on hierarchical scheduling on two uniform machines ⋮ Total completion time minimization scheduling on two hierarchical uniform machines ⋮ An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times ⋮ Semi-online scheduling with two GoS levels and unit processing time ⋮ Online scheduling on uniform machines with two hierarchies ⋮ Mixed coordination mechanisms for scheduling games on hierarchical machines ⋮ Online hierarchical scheduling: an approach using mathematical programming ⋮ Bin stretching with migration on two hierarchical machines ⋮ Online scheduling on two parallel identical machines under a grade of service provision ⋮ Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times ⋮ Online and semi-online hierarchical scheduling for load balancing on uniform machines ⋮ Optimal algorithms for semi-online machine covering on two hierarchical machines ⋮ Makespan minimization in online scheduling with machine eligibility ⋮ TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION ⋮ Makespan minimization in online scheduling with machine eligibility ⋮ Online scheduling of two job types on a set of multipurpose machines with unit processing times ⋮ An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies ⋮ Worst-case analysis for on-line service policies ⋮ Improved bounds for online scheduling with eligibility constraints ⋮ On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints ⋮ Heuristics for online scheduling on identical parallel machines with two GoS levels ⋮ Scheduling parallel machines with inclusive processing set restrictions and job release times ⋮ Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs ⋮ Online scheduling with migration on two hierarchical machines ⋮ On-line booking policies and competitive analysis of medical examination in hospital ⋮ Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
Cites Work
- Approximation algorithms for scheduling unrelated parallel machines
- Online and semi-online scheduling of two machines under a grade of service provision
- On-line algorithms for the channel assignment problem in cellular networks.
- Parallel machine scheduling under a grade of service provision
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- On-Line Load Balancing in a Hierarchical Server Topology
- The Competitiveness of On-Line Assignments
- Blow up of solutions to the Cauchy problem for nonlinear wave equations
This page was built for publication: Online scheduling on parallel machines with two goS levels
