Optimization of processing identical jobs by means of cyclic schedules

ArticleinJournal of Applied and Industrial Mathematics 3(4):496-504 · October 2009with1 Read
DOI: 10.1134/S1990478909040085

    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.