We consider an optimization problem for finite queues governed by priority-discarding control policies. We develop an analytical model for systems that defer discarding decisions until service completion instants, but then may expel any waiting jobs. Using stochastic dynamic programming techniques, we obtain closed-form optimization results for systems constrained to retain at most one job. Numerical performance examples are included.