A Search Solving Method of Two-Hoist Cyclic Scheduling Problem with Overlapping

To solve the two hoist cyclic scheduling problem with overlapping, a search solving method is proposed by dividing the whole problem into subproblems associated with sequencing. Better scheduling is obtained by searching good sequence in the sequence space. A numerical example is shown to validate.