A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
From MaRDI portal
Publication:336914
DOI10.1016/J.COR.2013.09.016zbMATH Open1348.68299OpenAlexW2082271152MaRDI QIDQ336914FDOQ336914
Authors: Jiping Tao 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.09.016
Recommendations
- scientific article; zbMATH DE number 6490206
- An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
- Online parallel-machine scheduling in KRT environment to minimize total weighted completion time
- On-line scheduling of parallel machines to minimize total completion times
- Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time
- Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time
- Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines
- scientific article; zbMATH DE number 2119710
- Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
- An experimental study of LP-based approximation algorithms for scheduling problems
- On-line scheduling of parallel machines to minimize total completion times
- LP-based online scheduling: From single to parallel machines
- Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem
- The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
- Single machine scheduling with release dates
- Efficient algorithms for average completion time scheduling
- Scheduling Unrelated Machines by Randomized Rounding
- Title not available (Why is that?)
- Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
- On-line scheduling to minimize average completion time revisited.
- A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times
- An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time
Cited In (11)
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
- Online scheduling to minimize the total weighted completion time plus the rejection cost
- Title not available (Why is that?)
- A \(2.28\)-competitive algorithm for online scheduling on identical machines
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem
- On-line scheduling of parallel machines to minimize total completion times
- A competitive online algorithm for minimizing total weighted completion time on uniform machines
- Randomized selection algorithm for online stochastic unrelated machines scheduling
- An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time
- Online parallel-machine scheduling in KRT environment to minimize total weighted completion time
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
This page was built for publication: A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336914)
