Pages that link to "Item:Q2488212"

The following pages link to An optimal rounding gives a better approximation for scheduling unrelated machines (Q2488212):

Displaying 50 items.

• Fast approximation algorithms for job scheduling with processing set restrictions (Q410716) (← links)
• On the configuration-LP for scheduling on unrelated machines (Q490331) (← links)
• Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
• Scheduling jobs with equal processing times subject to machine eligibility constraints (Q633548) (← links)
• Scheduling unit length jobs on parallel machines with lookahead information (Q657255) (← links)
• Approximate algorithms for unrelated machine scheduling to minimize makespan (Q747046) (← links)
• Resource-constrained machine scheduling with machine eligibility restriction and its applications to surgical operations scheduling (Q887890) (← links)
• On the complexity of constructing multiprocessor little-preemptive schedules (Q902062) (← links)
• On the geometry, preemptions and complexity of multiprocessor and shop scheduling (Q940887) (← links)
• A note on ``An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs'' (Q987836) (← links)
• A note on graph balancing problems with restrictions (Q990093) (← links)
• Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
• Scheduling parallel machines with inclusive processing set restrictions and job release times (Q1044087) (← links)
• Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) (← links)
• Scheduling for electricity cost in a smart grid (Q1702731) (← links)
• Restricted assignment scheduling with resource constraints (Q1713408) (← links)
• A 3/2-approximation algorithm for the graph balancing problem with two weights (Q1736801) (← links)
• Estimating the makespan of the two-valued restricted assignment problem (Q1751100) (← links)
• Approximation algorithms for scheduling on multi-core processor with shared speedup resources (Q1751153) (← links)
• Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan (Q1753395) (← links)
• Fast approximation algorithms for uniform machine scheduling with processing set restrictions (Q1753462) (← links)
• Parallel machine scheduling with speed-up resources (Q1754306) (← links)
• A hierarchical solution approach for a multicommodity distribution problem under a special cost structure (Q1761205) (← links)
• Online scheduling of two job types on a set of multipurpose machines with unit processing times (Q1761990) (← links)
• An improved lower bound for rank four scheduling (Q1785250) (← links)
• An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints (Q2014051) (← links)
• Multipurpose machine scheduling with rejection and identical job processing times (Q2018939) (← links)
• Scheduling jobs with release and delivery times subject to nested eligibility constraints (Q2033983) (← links)
• Preemptive and non-preemptive scheduling on two unrelated parallel machines (Q2093189) (← links)
• Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms (Q2152489) (← links)
• Makespan minimization on unrelated parallel machines with a few bags (Q2173300) (← links)
• Online scheduling with equal processing times and machine eligibility constraints (Q2257291) (← links)
• New bounds for truthful scheduling on two unrelated selfish machines (Q2300622) (← links)
• A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738) (← links)
• Approximation algorithms for the graph balancing problem with two speeds and two job lengths (Q2424664) (← links)
• Graph balancing: a special case of scheduling unrelated parallel machines (Q2441586) (← links)
• Parallel machine scheduling with nested processing set restrictions (Q2655610) (← links)
• On the extension complexity of scheduling polytopes (Q2661503) (← links)
• Unrelated parallel machine scheduling with new criteria: complexity and models (Q2668730) (← links)
• Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget (Q3004675) (← links)
• THE PRICE OF MULTI-ORGANIZATION CONSTRAINT IN UNRELATED PARALLEL MACHINE SCHEDULING (Q3144935) (← links)
• PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION (Q3655542) (← links)
• A Family of Scheduling Algorithms for Hybrid Parallel Platforms (Q4639930) (← links)
• (Q5075832) (← links)
• On minimizing the makespan when some jobs cannot be assigned on the same machine (Q5111718) (← links)
• Matching with sizes (or scheduling with processing set restrictions) (Q5891543) (← links)
• Matching with sizes (or scheduling with processing set restrictions) (Q5892177) (← links)
• Makespan minimization in online scheduling with machine eligibility (Q5894207) (← links)
• A PTAS for Scheduling Unrelated Machines of Few Different Types (Q5895057) (← links)
• Computing Nash equilibria for scheduling on restricted parallel links (Q5917951) (← links)