This article is cited in 2 papers

Construction of cyclic schedules in presence of parallel machines

E. A. Bobrova, V. V. Servakh

Omsk Branch of Sobolev Institute of Mathematics, 13 Pevtsov St., 644043 Omsk, Russia

Abstract: We consider the problem of processing some identical jobs with a complicated technological route on some production line in presence of parallel machines. Under some constraints on the number of jobs processed simultaneously, a cyclic schedule is desired with minimum cycle duration. Some algorithm for construction of an exact solution is proposed and substantiated. Also, we found the case of pseudopolynomially solvable problem. Illustr. 4, bibliogr. 16.

Keywords: cyclic schedule, dynamic programming, pseudopolynomial algorithm.

UDC: 519.8

Received: 03.07.2015
Revised: 30.08.2016

DOI: 10.17377/daio.2017.24.500

 English version: Journal of Applied and Industrial Mathematics, 2017, 11:1, 17–25

Bibliographic databases:

• 
• 
•