Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2119710
- Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time
- Competitive analysis of preemptive single-machine scheduling
- On-line scheduling to minimize average completion time revisited.
- Approximation and Online Algorithms
Cited in
(59)- 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
- Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine
- The power of \(\alpha\)-points in preemptive single machine scheduling.
- 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
- Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine
- 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
- 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 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
- A semi-online algorithm for solving the single machine scheduling problem to minimize total weighted completion time with discounted factor
- Minimizing total weighted completion time with unexpected machine unavailability
- Completion time scheduling and the WSRPT algorithm
- Online scheduling with known arrival times
- 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
- An optimal online algorithm for single machine scheduling to minimize total general completion time
- Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs
- 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
- scientific article; zbMATH DE number 2119710 (Why is no real title available?)
- Online over time scheduling on parallel-batch machines: a survey
- Minimizing weighted flow time
- Best semi-online algorithms for unbounded parallel batch scheduling
- Approximation and Online Algorithms
- 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
- Competitive analysis of preemptive single-machine scheduling
- A competitive online algorithm for minimizing total weighted completion time on uniform machines
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
- On-line single machine scheduling of unit time jobs with rejection: minimizing the maximum quadratic completion time
- Improved online scheduling with restarts on a single machine
- Online order acceptance and scheduling in a single machine environment
- Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling
- On-line scheduling to minimize average completion time revisited.
- Improved online scheduling with restarts on a single machine
- A note on ``An optimal online algorithm for single machine scheduling to minimize total general 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
This page was built for publication: Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704194)
