in V.8.A. A HEURISTIC ALGORITHM FOR THE n JOB, m MACHINE SEQUENCING PROBLEM * f

This p t ^ r describes a simfdie algorithm for the solution of very large sequence probiems witlutut the use of a computer. It produces approximate solutions to the n job, m madune sequencing problem where no passing is considered and the criterion is mjnimnin total elapsed time. Up to m-1 sequence may be found. Introductitm The search for a soluticm to the problem of finding an optimal or near optimal se-quence of jobs bdng osheduled in a flow shop type situation has given consideration to both exact and {^proximate techniques of solution. Exact techniques, which uraially require an dectzonic computer, have been developed to minimize some well criterion on problems involving a limited number of jobs [2,5,6,10]. [9] has pointed out that the researcher must be concemed not only with ob-taining an optioofd solution but also with the practical and economical application of ihe solution technique. It is the second aspect of the i»oblem which has led to the conraderation oi approximate methods. At this point in time coii^ianies with sequenc-ing problema involving large numbers of jobs and machines must use approximat