Fair round-robin scheduling of jobs.

This fixes a bug with picking jobs fairly when there are some empty queues. For
example, suppose queues A, and B are empty, while C and D each have 4 jobs.
Before this change, the scheduler would start searching at queue A and
eventually pick a job from C. Then it would start searching from B and pick
another job from C. Then it would start searching at C and pick a job from C.
Finally it would start searching from D and pick a job from D. So the jobs
would be executed in the order: C, C, C, D, C, D, D, D. But we would like
fair scheduling where the jobs alternate between C and D. To fix this bug,
the code starts the next search from the next queue that follows the one from
which we took the last job.

Also bump the version number to 0.1.4.

Author: Jack Veenstra

lib/resque/plugins/round_robin/round_robin.rb

@@ -44,6 +44,8 @@ def reserve_with_round_robin
           log! "Found job on #{queue}"
           return job
         end
+        # Start the next search at the queue after the one from which we pick a job.
+        @n += 1
       end
 
       nil

lib/resque/plugins/round_robin/version.rb

@@ -1,7 +1,7 @@
 module Resque
   module Plugins
     module RoundRobin
-      VERSION = "0.1.2"
+      VERSION = "0.1.4"
     end
   end
 end