title: Scheduling: Partition a set of integers into K subsets
body: <p>I'm working on a task scheduler and faced the following problem (distribution of tasks among processors):</p>
  
  <p><strong>There is a set of N integers. How to partition them into K disjoint subsets that have small difference of their sums?</strong></p>
  
  <p>I'm looking for a simple heuristics that has reasonable computational complexity for N=100-500 and K=10-20. There is no need in the optimal solution (i.e. minimal possible difference of sums), rough approximation is enough. </p>
  
  <p>Thanks in advance.</p>