Scheduling workflows for scattered objects
As a rule, the task of optimal scheduling, including reducing the total duration of the project occurs when developing and adjusting schedules. The essence of flow shop scheduling problem on the scattered objects with the use methods and models calendar planning was presented. The branch and boundary method were proposed as an exact method for determining the optimal permutation including the scheme of branching and rules for determining the lower boundaries. Heuristic algorithms for determining the optimal sequence of work for scattered objects was substantiated. The general applicability of the algorithms was demonstrated with calculations including 30 variants from distinct flows. The performed studies show the possibility of reducing the planned time by about 15 %. The suggested methodology can be recommended for use by construction project managers.