Scalable high quality hierarchical scheduling

List scheduling is well known for its implementation simplicity and O(N²) scalability, but not for result quality. The Ant-Colony scheduling algorithm, imitating the cooperative behaviors of ants, does generate high quality results, but like any stochastic search, has potentially long run times to assure high result quality. This paper presents a hierarchical scheduling algorithm using the ideas of ant colony, whose run time complexity is at the same scale as ordinary list scheduling, while generating results as good as the classic ant-colony scheduling algorithm. In practice, this implies a very substantial run-time improvement, enabling scheduling exploration of much larger problems while avoiding the pitfalls of over-constraint and lower quality results that hierarchical solutions are generally known for.