Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications
- 12 May 2011
- journal article
- research article
- Published by Springer Nature in Journal of Scheduling
- Vol. 15 (4) , 487-497
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A two-machine flowshop problem with processing time-dependent buffer constraints—An application in multimedia presentationsComputers & Operations Research, 2009
- Heuristic algorithms for ordering media objects to reduce presentation lags in auto‐assembled multimedia presentations from digital librariesThe Electronic Library, 2009
- Simple heuristics for scheduling with limited intermediate storageComputers & Operations Research, 2007
- Toward an integrated digital museum system – the Chi Nan experiencesInternational Journal on Digital Libraries, 2005
- Combinatorial Optimization2000
- Flowshop scheduling with limited temporary storageJournal of the ACM, 1980
- 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