Pages that link to "Item:Q751989"
From MaRDI portal
The following pages link to Approximation algorithms for scheduling unrelated parallel machines (Q751989):
Displaying 50 items.
- Multicriteria scheduling (Q2566699) (← links)
- A comment on scheduling two parallel machines with capacity constraints (Q2581321) (← links)
- On some special cases of the restricted assignment problem (Q2630343) (← links)
- Approximations and auctions for scheduling batches on related machines (Q2643820) (← links)
- Parallel machine scheduling with nested processing set restrictions (Q2655610) (← links)
- The largest-Z-ratio-first algorithm is 0.8531-approximate for scheduling unreliable jobs on \(m\) parallel machines (Q2661490) (← links)
- On the extension complexity of scheduling polytopes (Q2661503) (← links)
- A comparative study of solution representations for the unrelated machines environment (Q2664345) (← links)
- Wave order picking under the mixed-shelves storage strategy: a solution method and advantages (Q2669653) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- Capacitated vehicle routing with nonuniform speeds (Q2800377) (← links)
- Better bin packing approximations via discrepancy theory (Q2816297) (← links)
- Improved approximation schemes for scheduling unrelated parallel machines (Q2819574) (← links)
- Task swapping networks in distributed systems (Q2874305) (← links)
- Non-approximability results for scheduling problems with minsum criteria (Q2884502) (← links)
- Experimental comparison of approximation algorithms for scheduling unrelated parallel machines (Q2884532) (← links)
- Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms (Q2905284) (← links)
- ONLINE SCHEDULING OF MIXED CPU-GPU JOBS (Q2941090) (← links)
- Strategic Scheduling Games: Equilibria and Efficiency (Q2958675) (← links)
- Structured Instances of Restricted Assignment with Two Processing Times (Q2971651) (← links)
- Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget (Q3004675) (← links)
- Capacitated Vehicle Routing with Non-uniform Speeds (Q3009766) (← links)
- SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS (Q3022006) (← links)
- On the Configuration-LP for Scheduling on Unrelated Machines (Q3092258) (← links)
- A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates (Q3102810) (← links)
- THE PRICE OF MULTI-ORGANIZATION CONSTRAINT IN UNRELATED PARALLEL MACHINE SCHEDULING (Q3144935) (← links)
- Balancing perfectly periodic service schedules: An application from recycling and waste management (Q3166688) (← links)
- Scheduling of Jobs on Dissimilar Parallel Machine Using Computational Intelligence Algorithms (Q3296266) (← links)
- Complete Complexity Classification of Short Shop Scheduling (Q3392957) (← links)
- An absolute approximation algorithm for scheduling unrelated machines (Q3423277) (← links)
- GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE (Q3434271) (← links)
- Optimal Coordination Mechanisms for Unrelated Machine Scheduling (Q3450455) (← links)
- A unified approach to scheduling on unrelated parallel machines (Q3452224) (← links)
- Energy-Efficient Algorithms for Non-preemptive Speed-Scaling (Q3453287) (← links)
- The VCG Mechanism for Bayesian Scheduling (Q3460800) (← links)
- Santa Claus Meets Hypergraph Matchings (Q3541783) (← links)
- Convex programming for scheduling unrelated parallel machines (Q3581397) (← links)
- Latency Constrained Aggregation in Chain Networks Admits a PTAS (Q3638456) (← links)
- POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION (Q3646206) (← links)
- PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION (Q3655542) (← links)
- APPROXIMATE AND EXACT ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON UNRELATED PROCESSORS (Q3789320) (← links)
- PROPERTY OF THE OPTIMUM RELAXED SOLUTION FOR PROBLEM TO SCHEDULE INDEPENDENT TASKS ON UNRELATED PROCESSORS (Q3830805) (← links)
- Approximation Algorithms For Scheduling On Uniform Processors (Q4202255) (← links)
- Duality-Based Algorithms for Scheduling Unrelated Parallel Machines (Q4202586) (← links)
- Approximation algorithms for scheduling arithmetic expressions on pipelined machines (Q4203814) (← links)
- A Family of Scheduling Algorithms for Hybrid Parallel Platforms (Q4639930) (← links)
- Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds (Q4645931) (← links)
- Scheduling Unrelated Machines by Randomized Rounding (Q4785695) (← links)
- (Q4801952) (← links)
- Online Scheduling on a CPU-GPU Cluster (Q4922108) (← links)
