Allocation and tooling decisions in flexible manufacturing systems

Download

index.pdf

Date

2007

Author

Özpeynirci, Selin

Metadata

Show full item record

Item Usage Stats

163
views

65
downloads

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 operations where there are a limited number of tools of each type available and maximizing total weight minus total tooling cost where the tools can be used or purchased at a cost. We model the problems as Integer Linear Programs and show that they are NP-hard in the strong sense. For the total weight problem, we propose upper bounds, branch and bound algorithm for exact solutions and several heuristics for approximate solutions. For the bicriteria problem, we use Lagrangean relaxation technique to obtain lower and upper bounds. Our computational results have revealed that all solution approaches give satisfactory results in reasonable times.

URI

http://etd.lib.metu.edu.tr/upload/2/12609161/index.pdf
https://hdl.handle.net/11511/17437

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

A capacity allocation problem in flexible manufacturing systems Bilgin, Selin; Azizoğlu, Meral; Department of Industrial Engineering (2004) In this study, we consider a capacity allocation problem in flexible manufacturing systems. We assume time and tool magazine capacities on the Numerical Controlled (NC) machines and limited number of available tools. Our problem is to allocate the available capacity of the NC machines to the required demand of the operations, so as to maximize the total weight of operation assignments. We formulate the problem as a Mixed Integer Linear Program and show that it is NP-hard in the strong sense. We solve the mo...
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.
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...
Operation assignment and capacity allocation problem in automated manufacturing systems Bilgin, Selin; Azizoğlu, Meral (Elsevier BV, 2009-03-01) We address an operation assignment and capacity allocation problem that arises in semiconductor industries and flexible manufacturing systems. We assume the automated machines 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. We show that the problem is NP-hard in the strong sense, develop two heuristics and a Tabu Search procedure. The results of our computational tests have revealed that o...
Bounding approaches for operation assignment and capacity allocation problem in flexible manufacturing systems Özpeynirci, Selin; Azizoğlu, Meral (Elsevier BV, 2009-9) 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 test...

Citation Formats

S. Özpeynirci, “Allocation and tooling decisions in flexible manufacturing systems,” Ph.D. - Doctoral Program, Middle East Technical University, 2007.