Bounding approaches for operation assignment and capacity allocation problem in flexible manufacturing systems

Date

2009-9

Author

Özpeynirci, Selin
Azizoğlu, Meral

Metadata

Show full item record

Item Usage Stats

193
views

0
downloads

This study considers an operation assignment and capacity allocation problem that arises in flexible manufacturing systems. Automated machines are assumed to have scarce time and tool magazine capacities and the tools are available in limited quantities. The aim is to select a subset of operations with maximum total weight. The weight of an operation may represent its profit, processing load, relative priority. Several upper bounding procedures have been taken into account. The results of computational tests have revealed that the proposed upper bounding procedures produce satisfactory solutions in reasonable CPU times. We suggest using some of the bounds when the quality of the solutions is more important than the speed of achieving them and some others when the speed is more important than the quality.

Subject Keywords

Flexible manufacturing systems, Capacity allocation, Tool assignment, Upper bounds

URI

https://hdl.handle.net/11511/28348

Journal

Computers & Operations Research

DOI

https://doi.org/10.1016/j.cor.2008.10.006

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Capacity and tool allocation problem in flexible manufacturing systems Bilgin, Selin; Azizoğlu, Meral (2005-12-01) In this study, we consider capacity and tool allocation problem in flexible manufacturing environments. We assign the operations having priorities and processing requirements together with their required tools to a number of parallel machines having time and tool magazine capacities. We assume the number of available tools is limited and there is no partial operation assignments. Our aim is to maximize total weight over all assignments. We show that the problem is strongly NP-hard, and develop several appro...
Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches ÖZPEYNİRCİ, SELİN; Azizoğlu, Meral (Informa UK Limited, 2009-01-01) 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.
A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems ÖZPEYNİRCİ, SELİN; Azizoğlu, Meral (Informa UK Limited, 2010-05-01) This study considers the operation assignment and capacity allocation problem in flexible manufacturing systems. A set of operations is selected to be processed and assigned to the machines together with their required tools. The purchase or usage of the required tools incurs a cost. The machines have scarce time and tool magazine capacities. The objective is to maximize the total weight of the assigned operations minus the total tooling costs. We use Lagrangean relaxation approach to obtain upper and lower...
Beam search algorithm for capacity allocation problem in flexible manufacturing systems Ozpeynirci, Selin Bilgin; Azizoğlu, Meral (Elsevier BV, 2009-05-01) This study considers the operation assignment and tool allocation problem in flexible manufacturing systems. A set of operations together with their required tools are selected so as to maximize the total weight. The machines have limited time and tool magazine capacities and the tools are available in limited quantities. We develop a beam search algorithm and obtain near optimal solutions for large size problems very quickly.
Allocation and tooling decisions in flexible manufacturing systems Özpeynirci, Selin; Azizoğlu, Meral; Department of Industrial Engineering (2007) In this thesis, we consider a capacity allocation problem in flexible manufacturing systems. We assume limited time and tool magazine capacities on the Computer Numerically Controlled (CNC) machines. We have a set of operations that have to be assigned to the machines and each operation requires a set of tools to be processed. Our problem is to allocate the available capacity of the CNC machines to operations and their required tools. We consider two problems in this study: maximizing the total weight of op...

Citation Formats

S. Özpeynirci and M. Azizoğlu, “Bounding approaches for operation assignment and capacity allocation problem in flexible manufacturing systems,” Computers & Operations Research, pp. 2531–2540, 2009, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/28348.