AbstractIn this paper, we 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.