Optimal on-line algorithms for single-machine scheduling
From MaRDI portal
(Redirected from Publication:4645938)
Recommendations
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
- scientific article; zbMATH DE number 761265
- A class of on-line scheduling algorithms to minimize total completion time
- scientific article; zbMATH DE number 1235242
- scientific article; zbMATH DE number 2119710
Cites work
- Bounds for Certain Multiprocessing Anomalies
- scientific article; zbMATH DE number 44978 (Why is no real title available?)
- scientific article; zbMATH DE number 761265 (Why is no real title available?)
- New lower and upper bounds for on-line scheduling
- PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES
- Scheduling jobs that arrive over time
Cited in
(55)- On-line scheduling of parallel machines to minimize total completion times
- An optimal online algorithm for single machine scheduling with bounded delivery times
- On-line scheduling on a single machine: Minimizing the total completion time
- A look-ahead heuristic for scheduling jobs with release dates on a single machine
- The optimal on-line parallel machine scheduling
- Ordinal on-line scheduling for maximizing the minimum machine completion time
- Online scheduling problems with flexible release dates: applications to infrastructure restoration
- A class of on-line scheduling algorithms to minimize total completion time
- On-line scheduling in a surface treatment system
- Robust algorithms for total completion time
- Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
- Single-machine online scheduling of jobs with non-delayed processing constraint
- An optimal online algorithm for single-processor scheduling problem with learning effect
- Randomized selection algorithm for online stochastic unrelated machines scheduling
- A best possible algorithm for an online scheduling problem with position-based learning effect
- On-line booking policies and competitive analysis of medical examination in hospital
- Scheduling problems in transportation networks of line topology
- Generalization of EDF and LLF: Identifying all optimal online algorithms for minimizing maximum lateness
- Optimal on-line flow time with resource augmentation
- 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
- An improved greedy algorithm for stochastic online scheduling on unrelated machines
- Online NDP-constraint scheduling of jobs with delivery times or weights
- scientific article; zbMATH DE number 1670547 (Why is no real title available?)
- 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 integrated production-distribution scheduling problems without preemption
- Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness
- Online scheduling with known arrival times
- Online interval scheduling on a single machine with finite lookahead
- 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?)
- scientific article; zbMATH DE number 1559094 (Why is no real title available?)
- Online single machine scheduling to minimize the maximum starting time
- Maximizing job completions online
- scientific article; zbMATH DE number 2119710 (Why is no real title available?)
- scientific article; zbMATH DE number 761265 (Why is no real title available?)
- Online over time scheduling on parallel-batch machines: a survey
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
- An optimal online algorithm for scheduling with learning consideration
- Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms
- Algorithm Theory - SWAT 2004
- An online algorithm for a problem in scheduling with set-ups and release times
- On-line scheduling on a single machine: Maximizing the number of early jobs
- Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates
- On competitive analysis for polling systems
- Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling
- Joint replenishment meets scheduling
- A best possible online algorithm for minimizing the total completion time and the total soft penalty cost
- 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
- Improved online scheduling with restarts on a single machine
- Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling
- Improved online scheduling with restarts on a single machine
This page was built for publication: Optimal on-line algorithms for single-machine scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645938)
