Pages that link to "Item:Q2719134"
From MaRDI portal
The following pages link to Approximation techniques for average completion time scheduling (Q2719134):
Displaying 50 items.
- Single machine batch scheduling with release times and delivery costs (Q398839) (← links)
- Approximability of average completion time scheduling on unrelated machines (Q507314) (← links)
- Reducing network and computation complexities in neural based real-time scheduling scheme (Q632870) (← links)
- Improved results for scheduling batched parallel jobs by using a generalized analysis framework (Q666034) (← links)
- On-line scheduling to minimize average completion time revisited. (Q703266) (← links)
- Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time (Q837179) (← links)
- An on-line multi-CBR agent dispatching algorithm (Q855211) (← links)
- Scheduling problems in master-slave model (Q940888) (← links)
- Maximizing business value by optimal assignment of jobs to resources in grid computing (Q958577) (← links)
- On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems (Q985311) (← links)
- On-line scheduling of parallel machines to minimize total completion times (Q1010275) (← links)
- LP-based online scheduling: From single to parallel machines (Q1013970) (← links)
- Online scheduling to minimize modified total tardiness with an availability constraint (Q1034623) (← links)
- Scheduling parallel machines with inclusive processing set restrictions and job release times (Q1044087) (← links)
- Minimizing average completion time in the presence of release dates (Q1290642) (← links)
- On the approximability of average completion time scheduling under precedence constraints. (Q1408829) (← links)
- A 1. 47-approximation for a preemptive single-machine scheduling problem (Q1577468) (← links)
- The benefit of preemption for single machine scheduling so as to minimize total weighted completion time (Q1709959) (← links)
- On the on-line maintenance scheduling problem (Q1744635) (← links)
- Resource cost aware scheduling (Q1750475) (← links)
- A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective (Q1755846) (← links)
- A class of on-line scheduling algorithms to minimize total completion time (Q1811633) (← links)
- Lower bounds for on-line single-machine scheduling. (Q1874403) (← links)
- Robust algorithms for total completion time (Q2010916) (← links)
- Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection (Q2029304) (← links)
- Randomized selection algorithm for online stochastic unrelated machines scheduling (Q2082193) (← links)
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time (Q2098029) (← links)
- The benefit of preemption with respect to the \(\ell_p\) norm (Q2417189) (← links)
- Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints (Q2450684) (← links)
- The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates (Q2490322) (← links)
- On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems (Q2503352) (← links)
- A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection (Q2662527) (← links)
- The efficiency-fairness balance of round robin scheduling (Q2670464) (← links)
- Single machine scheduling with release dates (Q2784510) (← links)
- Almost sure asymptotic optimality for online routing and machine scheduling problems (Q3057128) (← links)
- Dual Techniques for Scheduling on a Machine with Varying Speed (Q3174696) (← links)
- Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530) (← links)
- Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling (Q3304142) (← links)
- Fair Scheduling via Iterative Quasi-Uniform Sampling (Q3304734) (← links)
- PARALLEL PROCESSING OF CONNECTION STREAMS IN NODES OF PACKET-SWITCHED COMPUTER COMMUNICATION SYSTEMS (Q3393475) (← links)
- Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316) (← links)
- Scheduling jobs that arrive over time (Q5057424) (← links)
- Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651) (← links)
- Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (Q5117378) (← links)
- A Tight 2-Approximation for Preemptive Stochastic Scheduling (Q5247621) (← links)
- Coping with Incomplete Information in Scheduling — Stochastic and Online Models (Q5391870) (← links)
- Stochastic Online Scheduling Revisited (Q5505682) (← links)
- On competitive analysis for polling systems (Q6072151) (← links)
- Joint replenishment meets scheduling (Q6102849) (← links)
- Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits (Q6547130) (← links)
