.png){kind=icon}
返回
A two-machine flowshop problem with processing time-dependent buffer constraints-An application in multimedia presentations
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2008.01.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
To have a quality multimedia presentation through networks, its presentation lag needs to be controlled. One way to reduce the lag is to prefetch the media objects before their due dates. This paper explores techniques for optimizing the object sequence in a prefetch-enabled TV-like presentation. An optimal solution is the one with which the presentation lag is minimized. We formulate the problem into a two-machine flowshop scheduling problem with a single chain precedence constraint and a player-side buffer constraint. The player-side buffer is processing time-dependent and distinguished from the conventional item-based intermediate buffer constraints discussed in previous flowshop studies. We prove the problem to he strongly NP-hard. A branch and bound algorithm equipped with four lower bounds and an NEH-based upper bound is developed. The simulation results show that the average gaps between the overall lower bounds and the NEH-based upper bound are less than 3% for problems with a large buffer size, and less than 13% for problems with a small buffer size and high density of precedence constraints. For applications where the media objects are delivered through extremely busy servers with which only very restricted CPU resources can be allocated for computation, the CDS-based algorithm provides better sequences than the NEH-based algorithm. (C) 2008 Elsevier Ltd. All rights reserved.
Keyword:
Multimedia presentation
Object sequence optimization
Buffer constraint
Two-machine flowshop
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Rationale for the ASSAIL-MI-trial: a randomised controlled trial designed to assess the effect of tocilizumab on myocardial salvage in patients with acute ST-elevation myocardial infarction (STEMI).png)
Open Heart
OAAI
Open HeartIF0
OAAI分享收藏An effective hybrid genetic algorithm for flow shop scheduling with limited buffers具有有限缓冲区的流水车间调度的有效混合遗传算法
PREAI
分享收藏分享收藏
查看更多内容