The following pages link to (Q3840371):
Displaying 18 items.
- On a local protocol for concurrent file transfers (Q487273) (← links)
- Complexity and approximation for precedence constrained scheduling problems with large communication delays (Q935152) (← links)
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- Flow shops with WIP and value added costs (Q969753) (← links)
- Combinatorial algorithms for data migration to minimize average completion time (Q1024212) (← links)
- A PTAS for the average weighted completion time problem on unrelated machines. (Q1592754) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective (Q1607979) (← links)
- Minimizing flow time on a constant number of machines with preemption (Q1779706) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- On the approximability of an interval scheduling problem (Q1806343) (← links)
- A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003) (← links)
- General scheduling non-approximability results in presence of hierarchical communications (Q2384613) (← links)
- A single-item economic lot-sizing problem with a non-uniform resource: Approximation (Q2482766) (← links)
- Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
- Scheduling Bidirectional Traffic on a Path (Q3448803) (← links)
- Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316) (← links)
- Order Scheduling Models: Hardness and Algorithms (Q5458825) (← links)
- A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times (Q5949906) (← links)
