Title

Designing cellular manufacturing systems: branch-and-bound and A* approaches

Document Type

Article

Peer Reviewed

1

Publication Date

1-1-1993

Journal/Book/Conference Title

IIE Transactions (Institute of Industrial Engineers)

Start Page

46

End Page

56

Abstract

In this paper heuristic and optimal algorithms for solving the group technology problem are presented. The heuristic algorithm is based on a branch-and-bound concept. A quadratic programming model for the machine grouping problem is formulated. The A* algorithm is developed for optimal solving of the machine grouping problem. The performance of the heuristic branch-and-bound method and the A* algorithm is compared with several existing heuristics.

Keywords

Sustainability

Published Article/Book Citation

IIE Transactions (Institute of Industrial Engineers), 25:4 (1993) pp.46-56.

This document is currently not available here.

Share

COinS
 

URL

https://ir.uiowa.edu/mie_pubs/72