Building the assembly line timetables in small- and medium-scale production

Algorithms are given for solving the actual for small- and medium-scale production problem of building the timetables of assembly works execution for some set of products, differing by production technologies. The optimality criterion of the task formulated is the fulfillment of the whole complex of works as quickly as possible. The sequence that is the most effective for practical implementation and close to the lower estimated bound on the optimal solution is determined, as well as the assembly operations start and end times for all products at each of the assembly stations, and the completion time of the production plan fulfillment. The algorithms developed are illustrated with numerical examples.