Scheduling with testing on multiple identical parallel machines
From MaRDI portal
Publication:832831
DOI10.1007/978-3-030-83508-8_3OpenAlexW3159741798MaRDI QIDQ832831FDOQ832831
Authors: Susanne Albers, Alexander Eckl 
Publication date: 25 March 2022
Full work available at URL: https://arxiv.org/abs/2105.02052
competitive analysisonline schedulingidentical parallel machinesmakespan minimizationexplorable uncertainty
Cites Work
- On-line scheduling revisited
- Speed is as powerful as clairvoyance
- Semi-online scheduling revisited
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- A better lower bound for on-line scheduling
- A lower bound for randomized on-line scheduling algorithms
- A lower bound for randomized on-line multiprocessor scheduling
- Title not available (Why is that?)
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- New algorithms for an ancient scheduling problem.
- The update complexity of selection and related problems
- Computing the Median with Uncertainty
- Computing minimum spanning trees with uncertainty
- Efficient update strategies for geometric computing with uncertainty
- The robust knapsack problem with queries
- Semi on-line algorithms for the partition problem
- Better Bounds for Online Scheduling
- The Power of Reordering for Online Minimum Makespan Scheduling
- A Better Algorithm for an Ancient Scheduling Problem
- On-line bin-stretching
- Optimal Search for the Best Alternative
- On randomized online scheduling
- Computing shortest paths with uncertainty
- A survey on makespan minimization in semi-online environments
- Explorable uncertainty in scheduling with non-uniform testing times
- An adversarial model for scheduling with testing
- The price of information in combinatorial optimization
- Title not available (Why is that?)
- Scheduling with explorable uncertainty
- Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
- An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
Cited In (5)
- Stochastic graph exploration with limited resources
- Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing
- Improved approximation algorithms for multiprocessor scheduling with testing
- Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
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)
