Models for video-on-demand scheduling with costs
From MaRDI portal
Publication:286685
DOI10.1007/s13675-015-0059-2zbMath1356.68025OpenAlexW2273888011MaRDI QIDQ286685
Angèle M. Hamel, Jean-Charles Grégoire
Publication date: 25 May 2016
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13675-015-0059-2
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Cites Work
- Unnamed Item
- New bounds for multidimensional packing
- Algorithms for on-line bin-packing problems with cardinality constraints
- Online bin packing with delay and holding costs
- A new upper bound 2.5545 on 2D Online Bin Packing
- All-Around Near-Optimal Solutions for the Online Bin Packing Problem
- Dynamic Bin Packing
- A simple on-line bin-packing algorithm
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
- Online Bin Packing with Cardinality Constraints
This page was built for publication: Models for video-on-demand scheduling with costs