This article is cited in 3 papers

Optimization of identical jobs production on the base of cyclic schedules

A. A. Romanova^a, V. V. Servakh<sup>b

a</sup> Omsk State University
^b Omsk Branch of Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Science

Abstract: Some cyclic job shop problems with identical jobs are researched. An exact algorithm for one of these problems based on the dynamic programming is proposed. We construct a fully polynomial time approximation scheme in the special case, when the number of simultaneously processing jobs is fixed. Illustr. 1, bibl. 17.

Keywords: cyclic schedule, identical jobs, dynamic programming, approximation scheme.

UDC: 519.2+621.391

Received: 19.12.2007
Revised: 30.07.2008

 English version: Journal of Applied and Industrial Mathematics, 2009, 3:4, 496–504

Bibliographic databases:

• 
• 
•