Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Scheduling hybrid flowshop with parallel batching machines and compatibilities
- Interval-indexed formulation based heuristics for single machine total weighted tardiness problem
- On-line scheduling of parallel machines to minimize total completion times
- LP-based online scheduling: From single to parallel machines
- Single machine precedence constrained scheduling is a Vertex cover problem
- Combinatorial algorithms for data migration to minimize average completion time
- Online scheduling to minimize modified total tardiness with an availability constraint
- Approximation results for a bicriteria job scheduling problem on a single machine without preemption
- 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.
- On the approximability of average completion time scheduling under precedence constraints.
- A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time
- A 1. 47-approximation for a preemptive single-machine scheduling problem
- A min-sum 3/2-approximation algorithm for scheduling unrelated parallel machines
- A PTAS for the average weighted completion time problem on unrelated machines.
- Restarts can help in the on-line minimization of the maximum delivery time on a single machine
- Off-line admission control for general scheduling problems
- 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
- Online scheduling problems with flexible release dates: applications to infrastructure restoration
- Online scheduling on bounded batch machines to minimize the maximum weighted completion time
- Splitting versus setup trade-offs for scheduling to minimize weighted completion time
- An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time
- Resource cost aware scheduling
- An integer programming approach to optimal basic block instruction scheduling for single-issue processors
- Reference points and approximation algorithms in multicriteria discrete optimization
- A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
- Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
- Approximation schemes for the min-max starting time problem
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- A class of on-line scheduling algorithms to minimize total completion time
- Lower bounds on precedence-constrained scheduling for parallel processors.
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
- A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
- Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
- New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints
- Randomized selection algorithm for online stochastic unrelated machines scheduling
- Decorous combinatorial lower bounds for row layout problems
- Preemptive and non-preemptive generalized min sum set cover
- An approximation scheme for the bi-scenario sum of completion times trade-off problem
- Risk-averse single machine scheduling: complexity and approximation
- A new approximation algorithm for unrelated parallel machine scheduling with release dates
- Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates
- Scheduling of tasks with effectiveness precedence constraints
- A polynomial-time approximation scheme for the airplane refueling problem
- Scheduling on unrelated machines under tree-like precedence constraints
- Online scheduling to minimize the total weighted completion time plus the rejection cost
- A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective
- Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints
- Approximation algorithms for average stretch scheduling
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
- Approximation algorithms for problems in scheduling with set-ups
- Computation of approximate -points for large scale single machine scheduling problem
- Designing PTASs for MIN-SUM scheduling problems
- The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
- On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
- A \(2.28\)-competitive algorithm for online scheduling on identical machines
- Decentralized utilitarian mechanisms for scheduling games
- A 2-approximation algorithm for the network substitution problem
- Approximating total flow time on parallel machines
- Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time
- The efficiency-fairness balance of round robin scheduling
- An improved greedy algorithm for stochastic online scheduling on unrelated machines
- Approximation techniques for average completion time scheduling
- A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting
- A bucket indexed formulation for nonpreemptive single machine scheduling problems
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- Online Linear Optimization for Job Scheduling Under Precedence Constraints
- Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines
- Vertex cover in graphs with locally few colors
- A new Lagrangian relaxation algorithm for scheduling dissimilar parallel machines with release dates
- Unrelated machine scheduling with stochastic processing times
- Optimal restricted due date assignment in scheduling
- Approximating weighted completion time for order scheduling with setup times
- Approximation algorithms for scheduling with resource and precedence constraints
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
- Approximate Deadline-Scheduling with Precedence Constraints
- Performance analysis of active schedules in identical parallel machine
- Approximating Single Machine Scheduling with Scenarios
- Scheduling with Outliers
- scientific article; zbMATH DE number 1187167 (Why is no real title available?)
- scientific article; zbMATH DE number 176780 (Why is no real title available?)
- Approximation scheduling algorithms: a survey
- On the Complexity of Scheduling to Optimize Average Response Time
- scientific article; zbMATH DE number 1982192 (Why is no real title available?)
- Single machine due date assignment scheduling problem with precedence constraints and controllable processing times in fuzzy environment
- Risk averse scheduling with scenarios
- Online parallel-machine scheduling in KRT environment to minimize total weighted completion time
- scientific article; zbMATH DE number 2102785 (Why is no real title available?)
- Minimizing makespan on parallel machines with release time and machine eligibility restrictions
- The feedback arc set problem with triangle inequality is a vertex cover problem
- scientific article; zbMATH DE number 871909 (Why is no real title available?)
- scientific article; zbMATH DE number 1445390 (Why is no real title available?)
- Corrigendum to: ``Greed works -- online algorithms for unrelated machine stochastic scheduling
- Truthful prompt scheduling for minimizing sum of completion times
- Scheduling jobs that arrive over time
- Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining
This page was built for publication: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4361782)
