Routing of permutations with constraints and nonstationary cost functions
Authors:
Abstract:
In article the problem of permutations routing with fulfillment of works in the sequence points is investigated. Theoretical method of solving and optimal algorithm realized on PC are constructed.