A two-machine flowshop problem with processing time-dependent buffer constraints-An application in multimedia presentations

Authors:
Feng-Cheng Lin;Jen-Shin Hong;Bertrand M. T. Lin
Affiliations:
Department of Computer Science and Information Engineering, National Chi Nan University, Nantou, Taiwan;Department of Computer Science and Information Engineering, National Chi Nan University, Nantou, Taiwan;Department of Information and Finance Management, Institute of Information Management, National Chiao Tung University, Hsinchu, Taiwan
Venue:
Computers and Operations Research
Year:
2009

Citing 7
Cited 3

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Algorithm performance and problem structure for flow-shop scheduling

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Flowshop scheduling with limited temporary storage

Journal of the ACM (JACM)
Scheduling Algorithms

Scheduling Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW Applications

Computers and Operations Research
An effective hybrid genetic algorithm for flow shop scheduling with limited buffers

Computers and Operations Research

Minimize presentation lag by sequencing media objects for auto-assembled presentations from digital libraries

Data & Knowledge Engineering
Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications

Journal of Scheduling
Sequence optimization for media objects with due date constraints in multimedia presentations from digital libraries

Information Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 be 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.