Abstract
In this research, we consider a resource assignment problem on TOC(Theory of Constrains)
Scheduling and propose an efficient solution procedure. The basic concept of the algorithm is to decrease
conflicting of resource between tasks on critical path and on subcritical path.