The heuristic requires O (n 3) time to find the location that "minimizes" the expected distance traveled. A worst case analysis of the heuristic indicates that it will produce a solution which is at ...

This paper describes a simple algorithm for the solution of very large sequence problems without the use of a computer. It produces approximate solutions to the n job, m machine sequencing problem ...