Solution of the generalized Johnson problem with constraints on the schedule and time of the machine. Part 2. Approximate methods of solution

The complex algorithm of the flow-shop problem solution using heuristics based on various hypotheses and preference rules is developed. The rules of construction of the tasks performance sequences that allow analyzing various areas of attraction of local minima are offered. The paper shows that efficiency of the constructed schedules increases due to the local variation algorithm offered. Comparison with earlier received solutions is given, the numerical example is made.