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

DOI10.1007/s10951-011-0235-zzbMath1280.90056OpenAlexW1969567620MaRDI QIDQ2434299

Yanyan Li

Publication date: 5 February 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-011-0235-z

zbMATH Keywords

schedulingflowshopmultimedia applicationsbuffer

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (6)

On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements ⋮ Flexible flow shop with dedicated buffers ⋮ Two-machine flow shops with an optimal permutation schedule under a storage constraint ⋮ A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements ⋮ Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements ⋮ Permutation schedules for a two-machine flow shop with storage

Cites Work

• Unnamed Item
• Simple heuristics for scheduling with limited intermediate storage
• A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
• Optimal two- and three-stage production schedules with setup times included
• Complex Scheduling
• Flowshop scheduling with limited temporary storage
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Combinatorial optimization. Theory and algorithms

This page was built for publication: Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications