Models for video-on-demand scheduling with costs (Q286685): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(9 intermediate revisions by 7 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s13675-015-0059-2 / rank | |||
Property / author | |||
Property / author: Jean-Charles Grégoire / rank | |||
Property / author | |||
Property / author: Jean-Charles Grégoire / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68M20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6585177 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
scheduling | |||
Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
video-on-demand | |||
Property / zbMATH Keywords: video-on-demand / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
online algorithms | |||
Property / zbMATH Keywords: online algorithms / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
clairvoyant | |||
Property / zbMATH Keywords: clairvoyant / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
non-clairvoyant | |||
Property / zbMATH Keywords: non-clairvoyant / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s13675-015-0059-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2273888011 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Online bin packing with delay and holding costs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms for on-line bin-packing problems with cardinality constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dynamic Bin Packing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Online Bin Packing with Cardinality Constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3988808 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new upper bound 2.5545 on 2D Online Bin Packing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: All-Around Near-Optimal Solutions for the Online Bin Packing Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A simple on-line bin-packing algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New bounds for multidimensional packing / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S13675-015-0059-2 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 13:30, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Models for video-on-demand scheduling with costs |
scientific article |
Statements
Models for video-on-demand scheduling with costs (English)
0 references
25 May 2016
0 references
scheduling
0 references
video-on-demand
0 references
online algorithms
0 references
clairvoyant
0 references
non-clairvoyant
0 references
0 references