An optimal online algorithm for scheduling two machines with release times
From MaRDI portal
Recommendations
- Online scheduling on two parallel machines with release times and delivery times
- Online scheduling on two parallel machines with release dates and delivery times
- Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
- Online scheduling of two uniform machines to minimize total completion times
- An optimal semi-online algorithm for 2-machine scheduling with an availability constraint
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- A best online algorithm for scheduling on two parallel batch machines
- An online algorithm for a problem in scheduling with set-ups and release times
- Online scheduling on two uniform machines to minimize the makespan
- Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines
Cites work
- A Better Algorithm for an Ancient Scheduling Problem
- A better lower bound for on-line scheduling
- A lower bound for randomized on-line multiprocessor scheduling
- A lower bound for randomized on-line scheduling algorithms
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- Bounds for Certain Multiprocessing Anomalies
- Competitive snoopy caching
- scientific article; zbMATH DE number 4130003 (Why is no real title available?)
- scientific article; zbMATH DE number 44978 (Why is no real title available?)
- scientific article; zbMATH DE number 65706 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 1094690 (Why is no real title available?)
- scientific article; zbMATH DE number 1559597 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- New algorithms for an ancient scheduling problem.
- New lower and upper bounds for on-line scheduling
- Randomized algorithms for on-line scheduling problems: How low can't you go?
- Randomized algorithms for that ancient scheduling problem
- Randomized competitive algorithms for the list update problem
- Scheduling on identical machines: How good is LPT in an on-line setting?
Cited in
(27)- A best online algorithm for scheduling on two parallel batch machines
- A best possible on-line algorithm for scheduling on uniform parallel-batch machines
- Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
- An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints
- An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan
- Heuristics for online scheduling on identical parallel machines with two GoS levels
- Online scheduling on two parallel machines with release dates and delivery times
- Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan
- Online scheduling on two parallel identical machines under a grade of service provision
- Online scheduling on two parallel machines with release times and delivery times
- On-line scheduling on parallel machines to minimize the makespan
- scientific article; zbMATH DE number 1342144 (Why is no real title available?)
- An \(\mathcal{O}(\log m)\)-competitive algorithm for online machine minimization
- Multi-priority online scheduling with cancellations
- Online makespan minimization: the power of restart
- Asymptotic Performance Ratio of an Online Algorithm for the Single Machine Scheduling With Release Dates
- Makespan minimization in online scheduling with machine eligibility
- Makespan minimization in online scheduling with machine eligibility
- LPT online strategy for parallel-machine scheduling with kind release times
- Well-behaved online load balancing against strategic jobs
- Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan
- Fifty years of research in scheduling -- theory and applications
- A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints
- Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan
- Online algorithms for scheduling with machine activation cost on two uniform machines
- An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times
This page was built for publication: An optimal online algorithm for scheduling two machines with release times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958718)
