Knapsack-based algorithms for designing cellular manufacturing systems

Knapsack-based algorithms for designing cellular manufacturing systems

0.00 Avg rating0 Votes
Article ID: iaor19972270
Country: United Kingdom
Volume: 47
Issue: 12
Start Page Number: 1468
End Page Number: 1476
Publication Date: Dec 1996
Journal: Journal of the Operational Research Society
Authors: , ,
Keywords: programming: integer
Abstract:

In this paper, the authors use a 0-1 linear programming model for the machine assignment problem in cellular manufacturing. The formulated machine assignment problem considers many manufacturing factors such as machine utilization cost, cost of intercellular moves, part demand, and operating time capacity. The problem is shown to be NP-complete. Two designing algorithms are proposed to exploit the problem structure of the knapsack problem. Computational experience of the two algorithms is also reported.

Reviews

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