scientific article; zbMATH DE number 1559527
From MaRDI portal
Publication:4526975
zbMath0962.68007MaRDI QIDQ4526975
Publication date: 28 February 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (26)
The impact of processing order on performance: a taxonomy of semi-FIFO policies ⋮ Average stretch without migration ⋮ Semi-clairvoyant scheduling ⋮ Maximizing job benefits on-line ⋮ Online weighted flow time and deadline scheduling ⋮ Approximating total flow time on parallel machines ⋮ SPT is optimally competitive for uniprocessor flow ⋮ Scheduling on unrelated machines under tree-like precedence constraints ⋮ An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem ⋮ A Modern View on Stability of Approximation ⋮ Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations ⋮ Fixed-Parameter Approximation Schemes for Weighted Flowtime. ⋮ Greedy multiprocessor server scheduling ⋮ Optimal on-line flow time with resource augmentation ⋮ Designing PTASs for MIN-SUM scheduling problems ⋮ Minimizing flow time on a constant number of machines with preemption ⋮ New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling ⋮ Minimizing Average Flow Time on Unrelated Machines ⋮ Scheduling in the dark ⋮ Polynomial time approximation algorithms for machine scheduling: Ten open problems ⋮ Non-clairvoyant scheduling for weighted flow time ⋮ Open problems in queueing theory inspired by datacenter computing ⋮ Minimizing Average Flow-Time ⋮ Fairness in parallel job scheduling ⋮ Online scheduling FIFO policies with admission and push-out ⋮ On-line scheduling to minimize Max flow time: an optimal preemptive algorithm
This page was built for publication:
