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.
- [Show abstract] [Hide abstract]
ABSTRACT: We consider the problem of finding cyclic schedules for a job shop in which all jobs are identical. Specifically, we assume that a single product is produced on a finite number of machines. Each part is manufactured by performing a given set of operations in a predetermined sequence. Each operation can be performed on exactly one machine. Key structural properties of cyclic schedules are studied. A search algorithm based on these properties is proposed, and preliminary computational tests of the algorithm are reported.Mathematics of Operations Research 01/1992; 17(4):842-865. · 0.90 Impact Factor
- Operations Research. 01/1956; 4(2):244-245.
- Operations Research 01/1963; 11(6):889-900. · 1.79 Impact Factor