The minimization of the amount of initial tokens in a Timed Event Graph (in short TEG) under throughput constraint is a crucial problem in industrial area such as the design of manufacturing systems or embedded systems. We show in this paper that this problem is strongly related to the K-colorability of a graph. Its NP-completeness and complexity results for other particular cyclic scheduling problems are then derived.