A graph-theoretical model for a periodic scheduling problem in an open shop is described; a given production requirement must be satisfied for each period of k time units. Necessary and sufficient conditions for the existence of such a schedule are given under some compactness conditions (each production job must be processed without any waiting time and processors must work continuously during a production phase).