scientific article
From MaRDI portal
Publication:2768123
zbMath1076.90025MaRDI QIDQ2768123
Jayant R. Haritsa, Sanjoy K. Baruah, Nitin Sharma
Publication date: 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (11)
Temperature aware online algorithms for scheduling equal length jobs ⋮ Online Throughput Maximization on Unrelated Machines: Commitment is No Burden ⋮ Online scheduling of jobs with kind release times and deadlines on a single machine ⋮ Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines ⋮ Online scheduling of bounded length jobs to maximize throughput ⋮ Temperature Aware Online Algorithms for Scheduling Equal Length Jobs ⋮ Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs ⋮ On-line scheduling on a single machine: Maximizing the number of early jobs ⋮ How to whack moles ⋮ A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines ⋮ A general framework for handling commitment in online throughput maximization
This page was built for publication:
