Using penalty function and Tabu search to solve cell formation problems with fixed cell cost

Using penalty function and Tabu search to solve cell formation problems with fixed cell cost

0.00 Avg rating0 Votes
Article ID: iaor20043174
Country: United Kingdom
Volume: 31
Issue: 1
Start Page Number: 21
End Page Number: 37
Publication Date: Jan 2004
Journal: Computers and Operations Research
Authors: ,
Keywords: production, heuristics, programming: integer
Abstract:

In this paper, an integrated approach for manufacturing cell formation with fixed charge cost is presented. The solution of the problem includes not only cell formation decisions but also cell set-up decisions. A mixed integer non-linear programming model is formulated to solve the problem. The NP-hardness of the problem makes direct solution computationally prohibitive for real-life applications. A heuristic algorithm was developed to solve the problem efficiently based on the features of the model and model duality analysis. Tabu search was used to find the optimal or sub-optimal solutions of the problem. Numerical examples are presented.

Reviews

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