Article ID: | iaor20002755 |
Country: | United Kingdom |
Volume: | 37 |
Issue: | 10 |
Start Page Number: | 2377 |
End Page Number: | 2397 |
Publication Date: | Jan 1999 |
Journal: | International Journal of Production Research |
Authors: | Zolfaghari S., Liang M. |
Keywords: | optimization: simulated annealing |
In a cellular manufacturing environment, once the machines and parts have been grouped the remaining tasks are sequencing part families and scheduling operations for the parts within each part family so that some planning goals such as minimization of tardiness can be achieved. This type of problem is called group scheduling and will be analysed in this paper. The solution of the group scheduling is affected by the machining speed specified for each operation since the completion time of each operation is a function of machining speed. As such, the group scheduling and machining speed selection problems should be simultaneously solved to provide meaningful solutions. This, however, further complicates the solution procedure. In view of this, a hybrid tabu-simulated annealing approach is proposed to solve the group scheduling problem. The main advantage of this approach is that a short term memory provided by the tabu list can be used to avoid solution re-visits while preserving the stochastic nature of the simulated annealing method. The performance of this new method has been tested and favourably compared with two other algorithms using tabu search and simulated annealing alone.