The construction schedule for the performance of tasks of parallel systems of machines and production lines

The development of Flow-Shop-Problem is considered. The mathematical model of scheduling for parallel working systems of machines under a given set of constraints on deadlines for separate tasks is considered. The properties of admissible and optimal schedules are examined and the methods of optimal scheduling by sequential optimization algorithms are proposed. The presented example shows the efficiency of the developed algorithms.