Job Rotation Scheduling in a New Arranged Lean Cell, a Genetic Algorithm Approach

Seeing that a lean cell performance is directly related to assigned operators, this article incorporates boredom in term of continually repeating working cycles as a function of the way in which operators assigned to and rotated in the cell during a specified short-term horizon and develops an integer nonlinear model to two problems, namely balancing and assignment in the case of arranging a new cell. The model is to satisfy some goals in term of lean performance measures and classic ones. None of the optimization packages is able to solve even the small size samples of the model due to formulating great number of nonlinear inequalities and non-pre-identified number of work cycles for each assigned operator per each rotation interval, as well. So, by applying the benefits of genetic algorithm the model is solved.