The tools transporter movements problem in flexible manufacturing sysems

Download

index.pdf

Date

2005

Author

Kılınç, Fatma

Metadata

Show full item record

Item Usage Stats

139
views

76
downloads

In this study, we address job sequencing and tool switching problem arising in Flexible Manufacturing Systems. We consider a single machine with limited tool slots on its tool magazine. The available tool slots cannot accommodate all the tools required by all jobs, therefore tool switches between jobs are required. A single tool transporter with limited capacity is used in transporting the tools from the storage area to the machine. Our aim is to minimize the number of tool transporter movements. We provide two mixed integer linear programming formulations of the problem, one of which is based on the traveling salesman problem. We develop a Branch-and-Bound algorithm powered with various lower and upper bounding techniques for optimal results. In order to obtain good solutions in reasonable times, we propose Beam Search algorithms. Our computational results reveal the satisfactory performance of the B&B algorithm for moderate sized problems. Moreover, Beam Search techniques perform well for large-sized problems.

Subject Keywords

General Technology.

URI

http://etd.lib.metu.edu.tr/upload/12606017/index.pdf
https://hdl.handle.net/11511/15083

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Minimizing the number of tool switching instants in Flexible Manufacturing Systems Konak, Abdullah; Kulturel-Konak, Sadan; Azizoğlu, Meral (Elsevier BV, 2008-12-01) In this study, we address a part-type sequencing and tool switching problem arising in Flexible Manufacturing Systems. We consider the single machine problem of minimizing the number of tool switching instants. We propose two tabu search approaches to find high-quality solutions. Our computational results reveal that both tabu search approaches produce optimal or near-optimal solutions in reasonable times.
Improving Oil-Rate Estimate in Capacitance/Resistance Modeling Using the Y-Function Method for Reservoirs Under Waterflood Temizel, Cenk; Artun, Emre; Yang, Zhengming (Society of Petroleum Engineers (SPE), 2019-08-01) Capacitance/resistance modeling (CRM) is an empirical waterflood modeling technique based on the signal correlations between injection rates and gross production rates. CRM can satisfactorily estimate the gross (liquid) production rate. The oil-production-rate forecast is based on fitting the empirical oil fractional-flow model, the Leverett (1941) oil fractional-flow model, or the Koval (1963) model to the historical production data. We observed that the oil-production-rate forecast in this approach is les...
A workflow based online software review system Çifci, Hasan; Demirörs, Onur; Department of Information Systems (2004) Software review is an effective and efficient way for detecting defects in software artifacts. To improve the effectiveness and the efficiency of software review, a variety of software review techniques have been developed. Furthermore, computer support has been used to facilitate the software review process. Accordingly, several software review tools have been developed. Although existing tools provide new solutions to support software review, in general they suffer from a number of shortcomings. In this s...
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.
Minimizing total flow time on a single flexible machine Karakayali, Ibrahim; Azizoğlu, Meral (Springer Science and Business Media LLC, 2006-03-01) In this study, we address a job sequencing and tool switching problem arising in flexible manufacturing systems. We consider the single machine problem of minimizing total flow time. We prove that the problem is NP-hard in the strong sense and show that the tool switching problem is polynomially solvable for a given sequence.

Citation Formats

F. Kılınç, “The tools transporter movements problem in flexible manufacturing sysems,” M.S. - Master of Science, Middle East Technical University, 2005.