Construction of cyclic schedules in presence of parallel machines

详细

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 constrains 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.