Pages that link to "Item:Q3925878"
From MaRDI portal
The following pages link to Algorithms for Scheduling Tasks on Unrelated Processors (Q3925878):
Displaying 33 items.
- Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
- Joint task assignment and cache partitioning with cache locking for WCET minimization on MPSoC (Q645822) (← links)
- Approximation algorithms for scheduling unrelated parallel machines (Q751989) (← links)
- The Pareto frontier of inefficiency in mechanism design (Q777959) (← links)
- Scheduling algorithms for procrastinators (Q835586) (← links)
- On-line service scheduling (Q835637) (← links)
- Scheduling unrelated parallel machines with sequence-dependent setups (Q883307) (← links)
- Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
- Coordination mechanisms for selfish scheduling (Q1014630) (← links)
- Worst-case analysis of a scheduling algorithm (Q1060946) (← links)
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines (Q1061599) (← links)
- Scheduling unit-time jobs on processors with different capabilities (Q1121780) (← links)
- Efficient scheduling of tasks without full use of processor resources (Q1145998) (← links)
- Heuristics for unrelated machine scheduling with precedence constraints (Q1290706) (← links)
- Dynamic scheduling on parallel machines (Q1331960) (← links)
- Unrelated parallel machine scheduling using local search (Q1341398) (← links)
- A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search (Q1362228) (← links)
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines (Q1363647) (← links)
- Restarts can help in the on-line minimization of the maximum delivery time on a single machine (Q1592755) (← links)
- On-line scheduling with precedence constraints (Q1602711) (← links)
- A note on on-line scheduling with precedence constraints on identical machines (Q1607065) (← links)
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach (Q1772848) (← links)
- 2-approximation algorithm for a generalization of scheduling on unrelated parallel machines (Q1799571) (← links)
- A cutting plane algorithm for the unrelated parallel machine scheduling problem (Q1847208) (← links)
- Heuristics for scheduling unrelated parallel machines (Q2276868) (← links)
- Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach (Q2371348) (← links)
- An optimal rounding gives a better approximation for scheduling unrelated machines (Q2488212) (← links)
- Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
- THE PRICE OF MULTI-ORGANIZATION CONSTRAINT IN UNRELATED PARALLEL MACHINE SCHEDULING (Q3144935) (← links)
- On the message complexity of distributed problems (Q3345763) (← links)
- Optimal Coordination Mechanisms for Unrelated Machine Scheduling (Q3450455) (← links)
- Approximation scheduling algorithms: a survey (Q4207781) (← links)