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

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...

Full description

Saved in:
Bibliographic Details
Published in:International journal of production research 2009-11, Vol.47 (21), p.5941-5958
Main Authors: ÖZPEYNIRCI, Selin, AZIZOGLU, Meral
Format: Article
Language:English
Subjects:
Allocations
Applied sciences
beam search
Branch & bound algorithms
branch and bound
capacity allocation
Exact sciences and technology
Flexible manufacturing systems
Inventory control, production control. Distribution
Operational research and scientific management
Operational research. Management science
Studies
tool assignment
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0020-7543
1366-588X
DOI:10.1080/00207540802154845