Pages that link to "Item:Q4327820"
From MaRDI portal
The following pages link to The Competitiveness of On-Line Assignments (Q4327820):
Displayed 50 items.
- Vertex cover meets scheduling (Q270025) (← links)
- On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines (Q358659) (← links)
- Fair online load balancing (Q398848) (← links)
- Coordination mechanisms with hybrid local policies (Q408369) (← links)
- Robust algorithms for preemptive scheduling (Q472464) (← links)
- A coordination mechanism for a scheduling game with parallel-batching machines (Q511705) (← links)
- Minimizing maximum (weighted) flow-time on related and unrelated machines (Q513278) (← links)
- Online hierarchical scheduling: an approach using mathematical programming (Q621843) (← links)
- Scheduling jobs with equal processing times subject to machine eligibility constraints (Q633548) (← links)
- Non-clairvoyant scheduling games (Q647492) (← links)
- Scheduling unit length jobs on parallel machines with lookahead information (Q657255) (← links)
- Improved bounds for online scheduling with eligibility constraints (Q719259) (← links)
- On-line service scheduling (Q835637) (← links)
- Online parallel machines scheduling with two hierarchies (Q837151) (← links)
- Online scheduling on two uniform machines subject to eligibility constraints (Q837188) (← links)
- Online and semi-online scheduling of two machines under a grade of service provision (Q867934) (← links)
- On-line load balancing made simple: greedy strikes back (Q924556) (← links)
- Preemptive scheduling on a small number of hierarchical machines (Q924724) (← links)
- The hierarchical model for load balancing on two machines (Q927189) (← links)
- Performance of service policies in a specialized service system with parallel servers (Q940910) (← links)
- Online scheduling on parallel machines with two goS levels (Q941832) (← links)
- A note on ``An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs'' (Q987836) (← links)
- Price of anarchy in parallel processing (Q991788) (← links)
- Coordination mechanisms for selfish scheduling (Q1014630) (← links)
- On the \(k\)-orientability of random graphs (Q1024456) (← links)
- On-line algorithms for the channel assignment problem in cellular networks. (Q1427805) (← links)
- New algorithms for related machines with temporary jobs. (Q1588054) (← links)
- On-line scheduling with precedence constraints (Q1602711) (← links)
- iGreen: green scheduling for peak demand minimization (Q1675631) (← links)
- Multiprofessor scheduling (Q1686063) (← links)
- Distributed backup placement in networks (Q1741963) (← links)
- Deferred on-line bipartite matching (Q1753111) (← links)
- Online scheduling of two job types on a set of multipurpose machines with unit processing times (Q1761990) (← links)
- On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints (Q1785422) (← links)
- Priority algorithms for makespan minimization in the subset model. (Q1853127) (← links)
- Parallel machine scheduling under a grade of service provision (Q1879792) (← links)
- An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times (Q1926488) (← links)
- Coordination mechanisms for parallel machine scheduling (Q1926738) (← links)
- An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies (Q2014427) (← links)
- The shortest first coordination mechanism for a scheduling game with parallel-batching machines (Q2361588) (← links)
- Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
- Rejecting jobs to minimize load and maximum flow-time (Q2409575) (← links)
- Optimal online algorithms for scheduling on two identical machines under a grade of service (Q2508148) (← links)
- Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
- Worst-case Nash equilibria in restricted routing (Q2637289) (← links)
- Strategic Scheduling Games: Equilibria and Efficiency (Q2958675) (← links)
- Optimal Coordination Mechanisms for Unrelated Machine Scheduling (Q3450455) (← links)
- Tight Bounds for Online Vector Scheduling (Q4620410) (← links)
- A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS (Q4650621) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5894207) (← links)