From Preemptive to Non-preemptive Scheduling Using Rejections
From MaRDI portal
Publication:2817893
DOI10.1007/978-3-319-42634-1_41zbMath1479.90102OpenAlexW2497949507MaRDI QIDQ2817893
Giorgio Lucarelli, Abhinav Srivastav, Denis Trystram
Publication date: 2 September 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hal.univ-grenoble-alpes.fr/hal-01371023/file/COCOON2016_110_final_v1.pdf
Cites Work
- Unnamed Item
- WSPT's competitive performance for minimizing the total weighted flow time: from single to parallel machines
- Online weighted flow time and deadline scheduling
- SPT is optimally competitive for uniprocessor flow
- Approximation algorithms for average stretch scheduling
- Optimal on-line flow time with resource augmentation
- Approximating total flow time on parallel machines
- Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
- Speed is as powerful as clairvoyance
- Online Scheduling to Minimize Average Stretch
- The Geometry of Scheduling
- Algorithms for minimizing weighted flow time
- Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model.
- A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract]
- Rejecting jobs to Minimize Load and Maximum Flow-time
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Optimal time-critical scheduling via resource augmentation
This page was built for publication: From Preemptive to Non-preemptive Scheduling Using Rejections