Host: Japan Society for Fuzzy Theory and Intelligent Informatics (SOFT)
This paper, we try to schedule TOC multipurpose problem with precedence relation and ambiguous resource allocation. The analyzed by DEA method completion time in the stage prior to the introduction of resources, ambiguous cases can be considered, we Precedence relation of work and allocation of resources, corresponding to the degree of satisfaction and satisfaction of each, optimum satisfaction I propose a method to calculate the completion time and degree. As a result, lead to minimization of the maximum completion time in TOC.