Pages that link to "Item:Q2434299"
From MaRDI portal
The following pages link to Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications (Q2434299):
Displaying 11 items.
- A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations (Q958450) (← links)
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications (Q1348546) (← links)
- Permutation schedules for a two-machine flow shop with storage (Q1785731) (← links)
- Multi-stream \((Q,r)\) model and optimization for data prefetching (Q2140320) (← links)
- On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements (Q2149603) (← links)
- Two-machine flow shops with an optimal permutation schedule under a storage constraint (Q2197318) (← links)
- A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements (Q2230732) (← links)
- Flexible flow shop with dedicated buffers (Q2414462) (← links)
- Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements (Q5915911) (← links)
- An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements (Q6497031) (← links)
- Algorithms for flow shop with job-dependent buffer requirements (Q6629020) (← links)
