Jobs of more than two products (n>2) must be manufactured in aproduction line of tanks. A hoist transports the jobs between tanks. If the size of bothbatches is equal and the number of jobs is high, a cyclic scheduling can be proposed.The problem consists in the scheduling of hoist movements, which is known as CHSP(Cyclic Hoist Scheduling Problem). The objective is double: first, determine a sequenceof the n products in a job cycle and then minimise the cycle time for the given sequenceof products (n-cycle). We propose the use of a branch-and-bound procedure previouslydeveloped, which was developed for the 2-cycle. As there are different sequences ofproducts, the experience demonstrates that the use of upper bounds as a result ofprevious steps in the algorithms generally leads to the optimum solution in lower times.