Ties in the averages of scores that commercial wine competitions employ to grant awards are common, and these ties make it difficult for competition officials to differentiate between wines, they erode the perception of judges’ expertise, and they can make compliance with competition rules arithmetically impossible. Responding to requests from competition officials, this article presents and evaluates six methods for breaking ties in averages of scores. Results show that using an Olympic Average, the mean excluding the highest and lowest scores, is easy to calculate, easy to communicate, effective, unbiased, and it is not inconsistent with the implications of a method of aggregating scores that is not prone to ties. (JEL Classifications: A10, C00, C10, C12, D12)

This paper addresses a one-machine scheduling problem in which the efficiency of the machine is not constant, that is the duration of a task is longer in badly efficient time periods. Each task has an irregular completion cost. Under the assumption that the efficiency constraints are time-periodic, we show that the special case where the sequence is fixed can be solved in polynomial time. The general case is NP-complete so that we propose a two-phase heuristic to find good solutions. Our approach is tested on problems with earliness-tardiness costs.