Pages that link to "Item:Q751989"

The following pages link to Approximation algorithms for scheduling unrelated parallel machines (Q751989):

Displaying 50 items.

• An approximation algorithm for scheduling on three dedicated machines (Q1897367) (← links)
• A lower bound of \(1+\varphi \) for truthful scheduling mechanisms (Q1949759) (← links)
• Assigning papers to referees (Q1959732) (← links)
• A comment on scheduling on uniform machines under chain-type precedence constraints (Q1977643) (← links)
• Multipurpose machine scheduling with rejection and identical job processing times (Q2018939) (← links)
• Optimal matroid partitioning problems (Q2032344) (← links)
• Scheduling jobs with release and delivery times subject to nested eligibility constraints (Q2033983) (← links)
• Algorithms for hierarchical and semi-partitioned parallel scheduling (Q2037194) (← links)
• Approximation algorithms for the load-balanced capacitated vehicle routing problem (Q2043586) (← links)
• Approximation algorithms for the multiprocessor scheduling with submodular penalties (Q2047204) (← links)
• Upper and lower degree-constrained graph orientation with minimum penalty (Q2062132) (← links)
• EPTAS for load balancing problem on parallel machines with a non-renewable resource (Q2085740) (← links)
• Preemptive and non-preemptive scheduling on two unrelated parallel machines (Q2093189) (← links)
• Performance guarantees of local search for minsum scheduling problems (Q2118098) (← links)
• Restricted max-min allocation: integrality gap and approximation algorithm (Q2149096) (← links)
• Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms (Q2152489) (← links)
• A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds (Q2164700) (← links)
• Exact makespan minimization of unrelated parallel machines (Q2165594) (← links)
• Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times (Q2168720) (← links)
• Makespan minimization on unrelated parallel machines with a few bags (Q2173300) (← links)
• Lot-size scheduling of a single product on unrelated parallel machines (Q2174901) (← links)
• Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
• Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints (Q2222091) (← links)
• Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors (Q2251359) (← links)
• Task assignment algorithms for two-type heterogeneous multiprocessors (Q2251393) (← links)
• Real-time scheduling with resource sharing on heterogeneous multiprocessors (Q2251407) (← links)
• Online scheduling with equal processing times and machine eligibility constraints (Q2257291) (← links)
• Worst-case analysis for on-line service policies (Q2268767) (← links)
• Parallel machine scheduling with nested job assignment restrictions (Q2270323) (← links)
• Heuristics for scheduling unrelated parallel machines (Q2276868) (← links)
• ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors (Q2281614) (← links)
• New bounds for truthful scheduling on two unrelated selfish machines (Q2300622) (← links)
• Fair by design: multidimensional envy-free mechanisms (Q2345204) (← links)
• Max-min fair rate allocation and routing in energy harvesting networks: algorithmic analysis (Q2362358) (← links)
• A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738) (← links)
• Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
• Parallel multiobjective evolutionary algorithms for batch scheduling in heterogeneous computing and grid systems (Q2376128) (← links)
• An \(R||C_{\max}\) quantum scheduling algorithm (Q2384180) (← links)
• Scheduling on unrelated machines under tree-like precedence constraints (Q2391177) (← links)
• Robust scheduling with budgeted uncertainty (Q2414457) (← links)
• Approximation algorithms for the graph balancing problem with two speeds and two job lengths (Q2424664) (← links)
• A complete 4-parametric complexity classification of short shop scheduling problems (Q2434295) (← links)
• A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation (Q2436693) (← links)
• Graph balancing: a special case of scheduling unrelated parallel machines (Q2441586) (← links)
• On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems (Q2484367) (← links)
• An optimal rounding gives a better approximation for scheduling unrelated machines (Q2488212) (← links)
• Sublogarithmic approximation for telephone multicast (Q2495404) (← links)
• Approximation schemes for scheduling and covering on unrelated machines (Q2503309) (← links)
• Optimal online algorithms for scheduling on two identical machines under a grade of service (Q2508148) (← links)
• Coordinating oligopolistic players in unrelated machine scheduling (Q2514126) (← links)