scientific article; zbMATH DE number 7051295
From MaRDI portal
Publication:4633939
zbMath1422.90017MaRDI QIDQ4633939
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496904
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (12)
An Optimal Control Framework for Online Job Scheduling with General Cost Functions ⋮ Minimizing the maximum flow time in the online food delivery problem ⋮ Unnamed Item ⋮ A best possible online algorithm for minimizing the total completion time and the total soft penalty cost ⋮ Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time ⋮ Non-Preemptive Flow-Time Minimization via Rejections ⋮ Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines ⋮ Energy efficient scheduling of parallelizable jobs ⋮ Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems ⋮ Non-clairvoyantly scheduling to minimize convex functions ⋮ The online food delivery problem on stars ⋮ Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time
This page was built for publication:
