Scheduling with testing on multiple identical parallel machines
From MaRDI portal
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
- A survey on makespan minimization in semi-online environments
- An adversarial model for scheduling with testing
- An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- Better Bounds for Online Scheduling
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Computing minimum spanning trees with uncertainty
- Computing shortest paths with uncertainty
- Computing the Median with Uncertainty
- Efficient update strategies for geometric computing with uncertainty
- Explorable uncertainty in scheduling with non-uniform testing times
- scientific article; zbMATH DE number 4130003 (Why is no real title available?)
- scientific article; zbMATH DE number 7075885 (Why is no real title available?)
- New algorithms for an ancient scheduling problem.
- On randomized online scheduling
- On-line bin-stretching
- On-line scheduling revisited
- Optimal Search for the Best Alternative
- Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
- Scheduling with explorable uncertainty
- Semi on-line algorithms for the partition problem
- Semi-online scheduling revisited
- Speed is as powerful as clairvoyance
- The Power of Reordering for Online Minimum Makespan Scheduling
- The price of information in combinatorial optimization
- The robust knapsack problem with queries
- The update complexity of selection and related problems
Cited in
(10)- Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- Improved approximation algorithms for multiprocessor scheduling with testing
- Stochastic graph exploration with limited resources
- Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time
- Scheduling with testing: competitive algorithms for minimizing the total weighted completion time in the adversarial model
- Perpetual scheduling with explorable uncertainty
- Learning-augmented query policies for minimum spanning tree with uncertainty
- Scheduling with obligatory tests
- Randomized algorithms for fully online multiprocessor scheduling with testing
This page was built for publication: Scheduling with testing on multiple identical parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832831)
