Partition into subsets and building admissible and optimal sequence of the tasks set performance on multiple machines

Abstract

The properties of the problems of building the admissible and optimal schedules for implementation of N tasks on the m machines under the condition of a loss of time on changeovers are investigated. On the basis of the established properties the operators of the inclusions are constructed from a consideration of the descriptions subsets, which do not contain admissible solutions. The algorithms for computing lower bounds for various optimality criteria and algorithms for solving the problems, which are considered by sequential algorithm optimization are proposed.