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

Authors:
Alexander Kononov;Jen-Shin Hong;Polina Kononova;Feng-Cheng Lin
Affiliations:
Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia;Dept. of Computer Science & Information Engineering, National Chi Nan University, Puli, Taiwan;Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia;Institute for Information Industry, Taipei, Taiwan
Venue:
Journal of Scheduling
Year:
2012

Citing 8
Cited 0

Flowshop scheduling with limited temporary storage

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Toward an integrated digital museum system – the Chi Nan experiences

International Journal on Digital Libraries - Special section on Digital Museum
Complex Scheduling (GOR-Publications)

Complex Scheduling (GOR-Publications)
Simple heuristics for scheduling with limited intermediate storage

Computers and Operations Research
Minimize presentation lag by sequencing media objects for auto-assembled presentations from digital libraries

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

Computers and Operations Research
Combinatorial Optimization: Theory and Algorithms

Combinatorial Optimization: Theory and Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Conventional studies on buffer-constrained flowshop scheduling problems have considered applications with a limitation on the number of jobs that are allowed in the intermediate storage buffer before flowing to the next machine. The study in Lin et al. (Comput. Oper. Res. 36(4):1158---1175, 2008a) considered a two-machine flowshop problem with "processing time-dependent" buffer constraints for multimedia applications. A "passive" prefetch model (the PP-problem), in which the download process is suspended unless the buffer is sufficient for keeping an incoming media object, was applied in Lin et al. (Comput. Oper. Res. 36(4):1158---1175, 2008a). This study further considers an "active" prefetch model (the AP-problem) that exploits the unoccupied buffer space by advancing the download of the incoming object by a computed maximal duration that possibly does not cause a buffer overflow. We obtain new complexity results for both problems.This study also proposes a new lower bound which improves the branch and bound algorithm presented in Lin et al. (Comput. Oper. Res. 36(4):1158---1175, 2008a). For the PP-problem, compared to the lower bounds developed in Lin et al. (Comput. Oper. Res. 36(4):1158---1175, 2008a), on average, the results of the simulation experiments show that the proposed new lower bound cuts about 38% of the nodes and 32% of the execution time for searching the optimal solutions.