The problem addressed in this paper is the possible improvement in,AS/KS throughput by sequencing retrievals in dual command cycles. Anexpected cycle time model is developed for a nearest-neighbor sequencing 0heuristic along with a lower bound on average cycle time. Some criticalelements in evaluating retrieval sequencing heuristics are also highlighted.