Optimization of processing identical jobs by means of cyclic schedules
ABSTRACT Some cyclic job shop problems with identical jobs are under study. Using dynamic programming, we propose an algorithm for
solving one of these problems exactly. In the special case of a fixed number of jobs which can be processed simultaneously,
we construct a fully polynomial time approximation scheme.