def queues_randomly_ordered
      list = queues_alpha_ordered

      list = select_only_queues(list)   if Fairly.options[:only].any?
      list = reject_except_queues(list) if Fairly.options[:except].any?

      list = list.sort_by do |item|
        weights = [rand] + priority_weights(item)
        weight = weights.reduce(&:*)
      end
      list = list.reverse
    end
def queues_randomly_ordered
      list = queues_alpha_ordered

      list = select_only_queues(list)   if Fairly.options[:only].any?
      list = reject_except_queues(list) if Fairly.options[:except].any?

      list = list.sort_by do |item|
        weights = [rand] + priority_weights(item)
        weight = weights.reduce(&:*)
      end
      list = list.reverse
    end
Returns a list of queues to use when searching for a job.  A
 splat ("*") means you want every queue

 The queues will be ordered randomly and the order will change
 with every call.  This prevents any particular queue for being
 starved.  Workers will process queues in a random order each
 time the poll for new work.

 If priorities have been established, the randomness of the order
 will be weighted according to the multipliers