scientific article; zbMATH DE number 871909
From MaRDI portal
Publication:4875178
Recommendations
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds
- Approximation techniques for average completion time scheduling
- scientific article; zbMATH DE number 2102785
Cited in
(53)- Interval-indexed formulation based heuristics for single machine total weighted tardiness problem
- LP-based online scheduling: From single to parallel machines
- Minimizing average completion time in the presence of release dates
- On the existence of schedules that are near-optimal for both makespan and total weighted completion time
- News from the online traveling repairman.
- A 1. 47-approximation for a preemptive single-machine scheduling problem
- Off-line admission control for general scheduling problems
- Scheduling space-sharing for internet advertising
- The power of \(\alpha\)-points in preemptive single machine scheduling.
- An experimental study of algorithms for weighted completion time scheduling
- Approximation algorithms for shop scheduling problems with minsum objective
- Resource cost aware scheduling
- A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
- A class of on-line scheduling algorithms to minimize total completion time
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine
- A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
- A new LP rounding algorithm for the active time problem
- Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates
- Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints
- Designing PTASs for MIN-SUM scheduling problems
- Approximation techniques for average completion time scheduling
- Single machine scheduling with release dates
- A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting
- Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
- Approximate Deadline-Scheduling with Precedence Constraints
- A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
- Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem
- Scheduling with Outliers
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- A supermodular relaxation for scheduling with release dates
- Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds
- scientific article; zbMATH DE number 2102785 (Why is no real title available?)
- scientific article; zbMATH DE number 1405788 (Why is no real title available?)
- scientific article; zbMATH DE number 1445389 (Why is no real title available?)
- scientific article; zbMATH DE number 1445390 (Why is no real title available?)
- Scheduling jobs that arrive over time
- Approximability of average completion time scheduling on unrelated machines
- Scheduling to approximate minimization objectives on identical machines
- Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations
- The geometry of scheduling
- Lift and project algorithms for precedence constrained scheduling to minimize completion time
- A primal-dual approximation algorithm for Min-sum single-machine scheduling problems
- scientific article; zbMATH DE number 2221455 (Why is no real title available?)
- Approximation Algorithms and Linear Programming Relaxations for Scheduling Problems Related to Min-Sum Set Cover
- Improved results for scheduling batched parallel jobs by using a generalized analysis framework
- The power of proportional fairness for nonclairvoyant polytope scheduling
- Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria
- Resource scheduling with variable requirements over time
- Approximating earliest arrival flows with flow-dependent transit times
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875178)
