Abstract
In this paper we deal with a one machine scheduling problem to minimize the mean weighted flow-trme subject to the constraint that the job tardiness is not greater than a specified value. An algorithm to obtain a pair. wise local optimum schedule for this problem has been. presented by Smith [4]. We give a necessary condition under which a pairwise local optimum schedule should not coincide with the global optimum one, and give an improved schedule for this case. On the basis of the analysis, an efficient algorithm is developed to obtain global optimum schedules for more cases than Smith's algorithm. Computational experiment is performed to show the quality of the solution, the computational time, and core memory size required for the algorithm in comparison with the previous three algorithms: Smith's, Burns', and DP.
