The following pages link to A note on sorting buffers offline (Q417998):
Displaying 10 items.
- NP-hardness of the sorting buffer problem on the uniform metric (Q427885) (← links)
- Exploiting locality: Approximating sorting buffers (Q925070) (← links)
- Reordering buffer management with advice (Q1707821) (← links)
- The forgotten sons: warehousing systems for brick-and-mortar retail chains (Q2028872) (← links)
- Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment (Q2664445) (← links)
- On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs (Q3448775) (← links)
- Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities (Q3448831) (← links)
- Almost Tight Bounds for Reordering Buffer Management (Q5864670) (← links)
- LATIN 2004: Theoretical Informatics (Q5901639) (← links)
- A review of synchronization problems in parts-to-picker warehouses (Q6167383) (← links)