GA and ICA approaches to job rotation scheduling problem: considering employee’s boredom

This paper presents a new model dealing with the job rotation scheduling problem, which is less studied, focusing on human characteristics such as boredom. Existing literature on conceptualizing boredom shows that researchers evaluate boredom in terms of exposure to the same tasks. We developed it to “exposure to similar tasks” and defined its functionality based on the need of assigning jobs with more similarity to each worker in the smallest period of planning which lowers the external interruption effect on worker’s concentration. To address the imbalance between number of jobs and that of workers in many industrial settings, we developed a multi-period imbalance assignment model. The proposed model is to rotate workers during a given planning horizon such that the total cost including assignment and boring cost will be minimized. The applicability of the model is described by presenting some real cases and validated through solving several randomly produced test problems by using Lingo software. Two search algorithms, genetic algorithm (GA) and imperialist competitive algorithm (ICA), designed to conquer the algorithmic complexity of model and their parameters adjusted using Taguchi’s method were used. The efficiency of algorithms is shown, comparing it with Lingo computation times, and it is shown that ICA solutions have better quality than GA solutions as well.