Abstract
This paper deals with the problem of sequencing n jobs on a single machine. Associated with each job is its processing time and its deferral rate. In addition, a general precedence relation exists among jobs. The problem is to find the job sequence which is consistent with the precedence relation so as to minimize the sum of the deferral cost. This problem has been considered by Sidney, and he has presented a decomposition aigorithm. In this paper, it is shown that Sidney's algorithm is not effective for some cases. A new algorithm is presented and it is proved that the algorithm produces an optimal sequence. An illustrative example is shown in the final section.
