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.
- Truthful mechanisms for two-range-values variant of unrelated scheduling (Q1019737) (← links)
- Optimal location with equitable loads (Q1026600) (← links)
- A lower bound for scheduling mechanisms (Q1031874) (← links)
- Scheduling parallel machines with inclusive processing set restrictions and job release times (Q1044087) (← links)
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines (Q1061599) (← links)
- Approximability of flow shop scheduling (Q1290640) (← links)
- Heuristics for unrelated machine scheduling with precedence constraints (Q1290706) (← links)
- A lexicographic approach to bi-objective loading of a flexible assembly system (Q1296131) (← links)
- Cellular control of manufacturing systems (Q1309976) (← links)
- An approximation algorithm for the generalized assignment problem (Q1319018) (← 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)
- Approximate algorithms for the \(P\parallel C_{\max}\) problem (Q1367883) (← links)
- Tight approximations for resource constrained scheduling and bin packing (Q1372745) (← links)
- On the existence of schedules that are near-optimal for both makespan and total weighted completion time (Q1375117) (← links)
- An approximation algorithm for scheduling two parallel machines with capacity constraints. (Q1408454) (← links)
- On-line algorithms for the channel assignment problem in cellular networks. (Q1427805) (← links)
- A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines (Q1592284) (← links)
- Approximation algorithms for general parallel task scheduling (Q1603514) (← links)
- Group activity selection problem with approval preferences (Q1621725) (← links)
- On the optimality of exact and approximation algorithms for scheduling problems (Q1635503) (← links)
- Setting lower bounds on truthfulness (Q1651232) (← links)
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) (← links)
- Approximation for scheduling on uniform nonsimultaneous parallel machines (Q1702658) (← links)
- Restricted assignment scheduling with resource constraints (Q1713408) (← links)
- A 3/2-approximation algorithm for the graph balancing problem with two weights (Q1736801) (← links)
- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (Q1749453) (← links)
- Estimating the makespan of the two-valued restricted assignment problem (Q1751100) (← links)
- Min-max cover of a graph with a small number of parts (Q1751107) (← 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)
- Scheduling unrelated parallel machines with optional machines and jobs selection (Q1762164) (← links)
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach (Q1772848) (← links)
- Minimizing flow time on a constant number of machines with preemption (Q1779706) (← links)
- An improved lower bound for rank four scheduling (Q1785250) (← links)
- 2-approximation algorithm for a generalization of scheduling on unrelated parallel machines (Q1799571) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- On the approximability of an interval scheduling problem (Q1806343) (← links)
- A cutting plane algorithm for the unrelated parallel machine scheduling problem (Q1847208) (← links)
- Priority algorithms for makespan minimization in the subset model. (Q1853127) (← links)
- Off-line temporary tasks assignment. (Q1853487) (← links)
- Approximation schemes for scheduling on uniformly related and identical parallel machines (Q1879359) (← links)
- Parallel machine scheduling under a grade of service provision (Q1879792) (← links)
- Scheduling of conditional executed jobs on unrelated processors (Q1897352) (← links)
