A tabu search approach for cell scheduling problem with makespan criterion

A tabu search approach for cell scheduling problem with makespan criterion

0.00 Avg rating0 Votes
Article ID: iaor2013388
Volume: 141
Issue: 2
Start Page Number: 639
End Page Number: 645
Publication Date: Feb 2013
Journal: International Journal of Production Economics
Authors: ,
Keywords: communications, combinatorial optimization, heuristics: tabu search, manufacturing industries
Abstract:

Scheduling problem in a cellular manufacturing system is treated as the group scheduling problem, assuming that intercellular moves can be eliminated by duplicating machines. However, in a typical CMS, duplicating bottleneck machines may be costly and infeasible. This fact limits the applicability of group scheduling. Scheduling problem in the presence of bottleneck machines is termed as cell scheduling. A mixed‐integer linear programming model is proposed for the attempted cell scheduling problem and a nested application of tabu search approach is investigated in this paper to solve the problem heuristically. The effectiveness of the proposed nested tabu search (NTS) algorithm is evaluated on 16 problems selected from the literature. Comparison of the results of NTS with SVS‐algorithm reveals the effectiveness and efficiency of the proposed algorithm.

Reviews

Required fields are marked *. Your email address will not be published.