Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Abstract The following job sequencing problems are studied: (i) single processor job sequencing with deadlines, (ii) job sequencing on $\textit{m}-identical$ processors to minimize finish time and related problems, (iii) job sequencing on 2-identical processors to minimize weighted mean flow time.Dynamic programming type algorithms are presented to obtain optimal solutions to these problems, and three general techniques are presented to obtain approximate solutions for optimization problems solvable in this way. The techniques are applied to the problems above to obtain polynomial time algorithms that generate “good” approximate solutions. ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1976-01-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 23 Issue Number 1 Page Count 12 Starting Page 116 Ending Page 127