SHMP solution for surface treatment line using an hybrid constraints satisfaction algorithm

Abstract

For single-hoist multi-products job shop scheduling problems, a constraints satisfaction algorithm CSA is successfully applied in this paper to find the optimal move sequence of the hoist that minimize the cycle period. Then, the CSA is hybridized with two classical heuristics to impose a criterion of selection of tasks according to their processing times. This hybridization generates better quality of solution. A real surface treatment line is studied with consideration of the minimization of the cycle time obtained by applying different algorithms. Comparative study is then presented to show the efficiency of the three proposed approaches and the preferment one is then selected.