Article

Optimization of processing identical jobs by means of cyclic schedules

Journal of Applied and Industrial Mathematics 04/2012; 3(4):496-504. DOI:10.1134/S1990478909040085 pp.496-504

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.

0 0
 · 
0 Bookmarks
 · 
39 Views
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.

Keywords

cyclic job shop problems
 
fixed number
 
polynomial time approximation scheme