scientific article; zbMATH DE number 2119710
From MaRDI portal
(Redirected from Publication:4828982)
Recommendations
- Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
- On-line scheduling on a single machine: Minimizing the total completion time
- Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time
- Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time
- An optimal online algorithm for single machine scheduling to minimize total general completion time
- On-line scheduling of parallel machines to minimize total completion times
- Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
- Online scheduling on bounded batch machines to minimize the maximum weighted completion time
- Optimal on-line algorithms for single-machine scheduling
- scientific article; zbMATH DE number 761265
Cited in
(26)- Job scheduling methods for reducing waiting time variance
- Completion time scheduling and the WSRPT algorithm
- On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions
- Approximation and Online Algorithms
- Machine Scheduling to Minimize Weighted Completion Times
- Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine
- A class of on-line scheduling algorithms to minimize total completion time
- Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time
- Competitive analysis of preemptive single-machine scheduling
- Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time
- A semi-online algorithm for solving the single machine scheduling problem to minimize total weighted completion time with discounted factor
- On-line scheduling to minimize average completion time revisited.
- Optimal on-line algorithms for single-machine scheduling
- Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
- The power of \(\alpha\)-points in preemptive single machine scheduling.
- Online scheduling with known arrival times
- Lower bounds for on-line single-machine scheduling.
- scientific article; zbMATH DE number 1947447 (Why is no real title available?)
- An optimal online algorithm for single machine scheduling to minimize total general completion time
- An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
- On the asymptotic optimality of algorithms for the flow shop problem with release dates
- Ordinal on-line scheduling for maximizing the minimum machine completion time
- Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
- Online scheduling to minimize total weighted (modified) earliness and tardiness cost
- Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates
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 Q4828982)
