From preemptive to non-preemptive scheduling using rejections

DOI10.1007/978-3-319-42634-1_41MaRDI QIDQ2817893zbMATH OpenOpenAlexFDO

Authors G. 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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Non-preemptive flow-time minimization via rejections
• Preemptive scheduling with rejection
• Approximation algorithms for average stretch scheduling
• scientific article; zbMATH DE number 1670665
• Mathematical Foundations of Computer Science 2005

Cites work

• A dynamic programming framework for non-preemptive scheduling problems on multiple machines
• Algorithms for minimizing weighted flow time
• Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
• Approximating total flow time on parallel machines
• Approximation algorithms for average stretch scheduling
• scientific article; zbMATH DE number 2079378 (Why is no real title available?)
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Minimizing weighted _p-norm of flow-time in the rejection model
• Online Scheduling to Minimize Average Stretch
• Online weighted flow time and deadline scheduling
• Optimal on-line flow time with resource augmentation
• Optimal time-critical scheduling via resource augmentation
• Rejecting jobs to Minimize Load and Maximum Flow-time
• Speed is as powerful as clairvoyance
• SPT is optimally competitive for uniprocessor flow
• The geometry of scheduling
• WSPT's competitive performance for minimizing the total weighted flow time: from single to parallel machines

Cited in

(2)

• From non-preemptive to preemptive scheduling using synchronization synthesis
• Preemptive multiprocessor scheduling with rejection

This page was built for publication: From preemptive to non-preemptive scheduling using rejections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817893)