The following pages link to (Q4818873):
Displayed 31 items.
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time (Q336914) (← links)
- On a local protocol for concurrent file transfers (Q487273) (← links)
- A time-indexed LP-based approach for min-sum job-shop problems (Q646647) (← links)
- Scheduling problems in master-slave model (Q940888) (← links)
- LP-based online scheduling: From single to parallel machines (Q1013970) (← links)
- Combinatorial algorithms for data migration to minimize average completion time (Q1024212) (← links)
- Minimizing average completion time in the presence of release dates (Q1290642) (← links)
- On the existence of schedules that are near-optimal for both makespan and total weighted completion time (Q1375117) (← links)
- News from the online traveling repairman. (Q1401247) (← links)
- A 1. 47-approximation for a preemptive single-machine scheduling problem (Q1577468) (← links)
- Fairness in parallel job scheduling (Q1588058) (← links)
- Off-line admission control for general scheduling problems (Q1592760) (← links)
- The power of \(\alpha\)-points in preemptive single machine scheduling. (Q1600001) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective (Q1607979) (← links)
- Precedence constrained scheduling to minimize sum of weighted completion times on a single machine (Q1961232) (← links)
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time (Q2098029) (← links)
- Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates (Q2294224) (← links)
- Incremental medians via online bidding (Q2482726) (← links)
- The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates (Q2490322) (← links)
- Multicriteria scheduling (Q2566699) (← links)
- An improved greedy algorithm for stochastic online scheduling on unrelated machines (Q2688463) (← links)
- A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting (Q2798120) (← links)
- Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time (Q2892135) (← links)
- Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds (Q4645931) (← links)
- An improved approximation algorithm for scheduling under arborescence precedence constraints (Q5089259) (← links)
- On-line load balancing for related machines (Q5096930) (← links)
- Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (Q5117378) (← links)
- Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling (Q5119844) (← links)
- Order Scheduling Models: Hardness and Algorithms (Q5458825) (← links)
- Stochastic Online Scheduling Revisited (Q5505682) (← links)
- Select and permute: an improved online framework for scheduling to minimize weighted completion time (Q5919414) (← links)