Rejecting jobs to minimize load and maximum flow-time

DOI10.1016/j.jcss.2017.07.006zbMath1378.68020OpenAlexW2751469631MaRDI QIDQ2409575

Syamantak Das, Anamitra R. Choudhury, Amit Kumar, Naveen Garg

Publication date: 11 October 2017

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2017.07.006

zbMATH Keywords

competitive ratioflow-timerestricted assignmentonline job schedulingrejection model

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Non-Preemptive Flow-Time Minimization via Rejections

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fair online load balancing
• Preemptive online scheduling with rejection of unit jobs on two uniformly related machines
• Semi-online scheduling revisited
• On-line scheduling to minimize Max flow time: an optimal preemptive algorithm
• Minimizing total flow time and total completion time with immediate dispatching
• Approximating total flow time on parallel machines
• All-Norms and All-L_p-Norms Approximation Algorithms
• Multi-processor scheduling to minimize flow time with ε resource augmentation
• Server scheduling in the L _p norm
• A robust maximum completion time measure for scheduling
• Better Algorithms for Minimizing Average Flow-Time on Related Machines
• Scheduling with Outliers
• Better Bounds for Online Scheduling
• The Competitiveness of On-Line Assignments
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• Multiprocessor Scheduling with Rejection
• On-Line Load Balancing for Related Machines
• A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation
• Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines
• Bounds for Certain Multiprocessing Anomalies
• Algorithms - ESA 2003

This page was built for publication: Rejecting jobs to minimize load and maximum flow-time