This paper considers Cyclic Jobshop Problem, which aim to find the tasks processing order for each machine that maximizes the throughput or equivalently minimizes the cycle time. We develop a branch and bound enumeration procedure to solve the Cyclic Jobshop Problem, based on heap of pieces theory and max,+ algebra. We propose an extension of this model to consider more structures of K-cyclic schedules. It provides more realistic values for the evaluation of the cycle time and improve the efficiency of the approach.
展开▼