عنوان مقاله [English]
in this paper, we develop an approach to determine an optimal schedule for cyclic open shop scheduling problems. Each operation needs some resources simultaneously. This problem is NP-hard. We formulate this problem by applying the concept of circular coloring problem. Then, an ant colony algorithm is developed. To verify the accuracy of this algorithm, we generate some instances with finite circular coloring numbers equal to k/d and solve them by the proposed algorithm.