A class of on-line scheduling algorithms to minimize total completion time
From MaRDI portal
Recommendations
- Approximation and Online Algorithms
- scientific article; zbMATH DE number 871909
- On-line scheduling to minimize average completion time revisited.
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- On-line scheduling on a single machine: Minimizing the total completion time
- On-line scheduling of parallel machines to minimize total completion times
- An optimal online algorithm for single machine scheduling to minimize total general completion time
- Total completion time minimization in online hierarchical scheduling of unit-size jobs
- scientific article; zbMATH DE number 2119710
- Minimizing completion time for a class of scheduling problems
Cites work
- Approximation techniques for average completion time scheduling
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- scientific article; zbMATH DE number 1094690 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Minimizing average completion time in the presence of release dates
- Minimizing mean flow time with release time constraint
- Online algorithms. The state of the art
- Optimal on-line algorithms for single-machine scheduling
Cited in
(35)- On-line scheduling of parallel machines to minimize total completion times
- Online scheduling to minimize modified total tardiness with an availability constraint
- On-line scheduling on a single machine: Minimizing the total completion time
- Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine
- Ordinal on-line scheduling for maximizing the minimum machine completion time
- An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
- Robust algorithms for total completion time
- Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
- An optimal online algorithm for single-processor scheduling problem with learning effect
- Online scheduling of time-critical tasks to minimize the number of calibrations
- A \(2.28\)-competitive algorithm for online scheduling on identical machines
- A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection
- Predictive-reactive strategy for identical parallel machine rescheduling
- An on-line LS algorithm for some \(Q_m|r_j|C_{\max}\) scheduling
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
- Online non-preemptive scheduling to optimize max stretch on a single machine
- Online integrated production-distribution scheduling problems without preemption
- Online scheduling of simple linear deteriorating jobs to minimize the total general completion time
- An optimal online algorithm for single machine scheduling to minimize total general completion time
- scientific article; zbMATH DE number 1235242 (Why is no real title available?)
- Optimal algorithms for online single machine scheduling with deteriorating jobs
- Optimal on-line algorithms for single-machine scheduling
- scientific article; zbMATH DE number 761265 (Why is no real title available?)
- Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms
- Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates
- On competitive analysis for polling systems
- A best possible online algorithm for minimizing the total completion time and the total soft penalty cost
- Reducing network and computation complexities in neural based real-time scheduling scheme
- A competitive online algorithm for minimizing total weighted completion time on uniform machines
- Minimizing the total completion time for a class of semi-online single machine scheduling problems
- On-line scheduling to minimize average completion time revisited.
- A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time
- Optimally competitive list batching
- Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time
- Job scheduling methods for reducing waiting time variance
This page was built for publication: A class of on-line scheduling algorithms to minimize total completion time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1811633)
