The Competitiveness of On-Line Assignments
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 742966
- scientific article; zbMATH DE number 1232130
- Maintaining assignments online: matching, scheduling, and flows
- Competitive analysis of incentive compatible on-line auctions
- The online specialization problem
- scientific article; zbMATH DE number 2038744
- On the competitive ratio for online facility location
Cited in
(64)- Fair online load balancing
- The adwords problem with strict capacity constraints
- Online scheduling of two job types on a set of multipurpose machines with unit processing times
- Online scheduling with unit processing times and processing set restrictions
- Makespan minimization in online scheduling with machine eligibility
- On-line load balancing made simple: greedy strikes back
- Configuration balancing for stochastic requests
- Decentralized utilitarian mechanisms for scheduling games
- On-line load balancing of temporary tasks revisited
- Vertex cover meets scheduling
- Online fractional hierarchical scheduling on uniformly related machines
- Distributed backup placement in networks
- On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines
- Optimal coordination mechanisms for unrelated machine scheduling
- Scheduling jobs with equal processing times subject to machine eligibility constraints
- A note on ``An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
- Worst-case Nash equilibria in restricted routing
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- scientific article; zbMATH DE number 742966 (Why is no real title available?)
- Parallel machine scheduling under a grade of service provision
- Efficient coordination mechanisms for unrelated machine scheduling
- New algorithms for related machines with temporary jobs.
- Improved bounds for online scheduling with eligibility constraints
- Tight bounds for online vector scheduling
- On-line algorithms for the channel assignment problem in cellular networks.
- Online scheduling on two uniform machines subject to eligibility constraints
- Coordination mechanisms with hybrid local policies
- Strategic scheduling games: equilibria and efficiency
- Fully-dynamic load balancing
- On-line service scheduling
- Coordination mechanisms for selfish scheduling
- Fully-dynamic load balancing
- Preemptive scheduling on a small number of hierarchical machines
- The hierarchical model for load balancing on two machines
- On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints
- The shortest first coordination mechanism for a scheduling game with parallel-batching machines
- Robust algorithms for preemptive scheduling
- Online hierarchical scheduling: an approach using mathematical programming
- On the k-orientability of random graphs
- Priority algorithms for makespan minimization in the subset model.
- iGreen: green scheduling for peak demand minimization
- Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs
- Price of anarchy in parallel processing
- Scheduling unit length jobs on parallel machines with lookahead information
- Configuration balancing for stochastic requests
- Multiprofessor scheduling
- Coordination mechanisms for parallel machine scheduling
- Deferred on-line bipartite matching
- On-line scheduling with precedence constraints
- Online unrelated-machine load balancing and generalized flow with recourse
- Rejecting jobs to minimize load and maximum flow-time
- A coordination mechanism for a scheduling game with parallel-batching machines
- Minimizing maximum (weighted) flow-time on related and unrelated machines
- Online parallel machines scheduling with two hierarchies
- Online and semi-online scheduling of two machines under a grade of service provision
- Makespan minimization in online scheduling with machine eligibility
- Non-clairvoyant scheduling games
- Online scheduling with migration on two hierarchical machines
- Online scheduling on parallel machines with two goS levels
- An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies
- An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
- Performance of service policies in a specialized service system with parallel servers
- Competitive strategies for an online generalized assignment problem with a service consecution constraint
- A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS
This page was built for publication: The Competitiveness of On-Line Assignments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4327820)
