Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches

---

Copy For Citation

ÖZPEYNİRCİ S., AZİZOĞLU M.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, vol.47, no.21, pp.5941-5958, 2009 (SCI-Expanded)

• Publication Type: Article / Article
• Volume: 47 Issue: 21
• Publication Date: 2009
• Doi Number: 10.1080/00207540802154845
• Journal Name: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
• Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
• Page Numbers: pp.5941-5958
• Middle East Technical University Affiliated: Yes

Abstract

This study considers an operation assignment and capacity allocation problem that arises in flexible manufacturing systems. The machines have limited time and tool magazine capacities and the available tools are limited. Our objective is to maximise total weight of assigned operations. We develop a branch and bound algorithm that finds the optimal solutions and a beam search algorithm that finds high quality solutions in polynomial time.