Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
From MaRDI portal
Publication:5704194
DOI10.1287/moor.1040.0092zbMath1082.90033MaRDI QIDQ5704194
Chris N. Potts, Edward J. Anderson
Publication date: 11 November 2005
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1040.0092
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time, Online Single Machine Scheduling to Minimize the Maximum Starting Time, Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time, LPT online strategy for parallel-machine scheduling with kind release times, On competitive analysis for polling systems, Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling, Joint replenishment meets scheduling, Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine, Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines, A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time, Online scheduling of simple linear deteriorating jobs to minimize the total general completion time, An on-line scheduling problem of parallel machines with common maintenance time, Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs, Online over time scheduling on parallel-batch machines: a survey, Best semi-online algorithms for unbounded parallel batch scheduling, Competitive analysis of preemptive single-machine scheduling, Online scheduling with linear deteriorating jobs to minimize the total weighted completion time, Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine, Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time, An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time, On-line scheduling of parallel machines to minimize total completion times, LP-based online scheduling: From single to parallel machines, Online scheduling to minimize modified total tardiness with an availability constraint, Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead, Online over time processing of combinatorial problems, Online scheduling problems with flexible release dates: applications to infrastructure restoration, Online scheduling on bounded batch machines to minimize the maximum weighted completion time, An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time, The medical laboratory scheduling for weighted flow-time, Applying ``peeling onion approach for competitive analysis in online scheduling with rejection, Online scheduling to minimize total weighted (modified) earliness and tardiness cost, An optimal online algorithm for single-processor scheduling problem with learning effect, Randomized selection algorithm for online stochastic unrelated machines scheduling, Scheduling of tasks with effectiveness precedence constraints, Online scheduling to minimize the total weighted completion time plus the rejection cost, Online scheduling of jobs with kind release times and deadlines on a single machine, A \(2.28\)-competitive algorithm for online scheduling on identical machines, The efficiency-fairness balance of round robin scheduling, A SEMI-ON-LINE SCHEDULING PROBLEM OF TWO PARALLEL MACHINES WITH COMMON MAINTENANCE TIME, Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
