From: omerbeg@gmail.com   
      
   There is some recent work on optimal scheduling which compares with   
   the list scheduling heuristic.  The problem is that the list scheduler   
   is very close to optimal and much faster than the optimal one.   
      
   Abid M. Malik, Jim McInnes, and Peter van Beek. Optimal basic block   
   instruction scheduling for multiple-issue processors using constraint   
   programming. Proceedings of the 18th IEEE International Conference on   
   Tools with Artificial Intelligence,  Washington, DC, 279-287,   
   November, 2006. A longer version appears in the International J. of AI   
   Tools, 17:37-54, 2008.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)