Pages that link to "Item:Q3452224"
From MaRDI portal
The following pages link to A unified approach to scheduling on unrelated parallel machines (Q3452224):
Displaying 32 items.
- Approximation algorithms for scheduling unrelated parallel machines (Q751989) (← links)
- Machine scheduling with resource dependent processing times (Q877194) (← links)
- A scheduling problem with unrelated parallel machines and sequence dependent setups (Q973463) (← links)
- A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines (Q1592284) (← links)
- Exact methods for order acceptance and scheduling on unrelated parallel machines (Q1725610) (← links)
- An almost ideal coordination mechanism for unrelated machine scheduling (Q1733383) (← links)
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources (Q1753460) (← links)
- Scheduling unrelated parallel machines with optional machines and jobs selection (Q1762164) (← links)
- Approximation algorithms for clustering with dynamic points (Q2168849) (← links)
- Non-clairvoyantly scheduling to minimize convex functions (Q2319644) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738) (← links)
- Graph balancing: a special case of scheduling unrelated parallel machines (Q2441586) (← links)
- Randomized rounding in the presence of a cardinality constraint (Q2828177) (← links)
- Experimental comparison of approximation algorithms for scheduling unrelated parallel machines (Q2884532) (← links)
- On the Configuration-LP for Scheduling on Unrelated Machines (Q3092258) (← links)
- Convex programming for scheduling unrelated parallel machines (Q3581397) (← links)
- Tight Bounds for Online Vector Scheduling (Q4620410) (← links)
- Scheduling Unrelated Machines by Randomized Rounding (Q4785695) (← links)
- Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316) (← links)
- Simpler and Better Algorithms for Minimum-Norm Load Balancing (Q5075764) (← links)
- Concentration inequalities for nonlinear matroid intersection (Q5252262) (← links)
- Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines (Q5419000) (← links)
- A desired load distribution model for scheduling of unrelated parallel machines (Q5478812) (← links)
- An enhanced formulation and simple heuristic for scheduling jobs on unrelated parallel machines (Q5696463) (← links)
- Automata, Languages and Programming (Q5716831) (← links)
- (Q5743409) (← links)
- (Q5743474) (← links)
- An EPTAS for scheduling on unrelated machines of few different types (Q5919620) (← links)
- Approximating scheduling unrelated parallel machines in parallel (Q5961071) (← links)
- Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost (Q6105902) (← links)
- Approximating weighted completion time via stronger negative correlation (Q6620463) (← links)
