Two-stage multimedia scheduling problem with an active prefetch model
Authors:
- Alexander V. KononovAKAlexander V. Kononov
- Polina A. KononovaPKPolina A. Kononova
- Jen-Shin HongJHJen-Shin Hong
- 1 January 2009
- journal article
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 42 (4) , 2001-2006
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- A two-machine flowshop problem with processing time-dependent buffer constraints—An application in multimedia presentationsComputers & Operations Research, 2009
- Minimize presentation lag by sequencing media objects for auto-assembled presentations from digital librariesData & Knowledge Engineering, 2008
- Toward an integrated digital museum system – the Chi Nan experiencesInternational Journal on Digital Libraries, 2005
- Local branchingMathematical Programming, 2003
- Algorithms for the Set Covering ProblemAnnals of Operations Research, 2000
- Variable neighborhood searchComputers & Operations Research, 1997
- Flowshop scheduling with limited temporary storageJournal of the ACM, 1980
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman ProblemOperations Research, 1964
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954