The tool transporter movements problem in flexible manufacturing systems

Date

2008-01-01

Author

Karzan, Fatma Kilinc
Azizoğlu, Meral

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

13
views

0
downloads

We consider a job sequencing and tool transporter movements problem on a single flexible machine with limited tool magazine capacity. A tool transporter having limited capacity is used in transporting the tools between the machine and tool crib area. Our aim is to minimize the number of the tool transporter movements. We present several lower and upper bounds, propose a Branch-and-Bound algorithm and a Beam Search procedure, and report results from a computational experiment. We find that optimal solutions can be quickly obtained for medium-sized instances with 25 jobs and 25 tools. For large-sized problem instances, Beam Search provides high quality solutions very quickly. Finally, we address the problem of minimizing the total flow time.

Subject Keywords

Flexible manufacturing systems, Tool transporter movements, Branch-and-bound, Beam search

URI

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

Journal

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH

DOI

https://doi.org/10.1080/00207540601070135

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

The tools transporter movements problem in flexible manufacturing sysems Kılınç, Fatma; Azizoğlu, Meral; Department of Industrial Engineering (2005) 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...
A branch and bound method for the line balancing problem in U-shaped assembly lines with equipment requirements Ogan, Dilek; Azizoğlu, Meral (2015-07-01) In this study we consider a U-shaped assembly line balancing problem where each task uses a specified set of equipments and each type of equipment has a specified cost. Our problem is to assign the tasks together with their equipments to the workstations so as to minimize the total equipment cost. We formulate the problem as a mixed integer linear programming model that is capable of solving small sized instances. We propose a branch and bound algorithm that uses efficient precedence relations and lower bou...
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.
A generic model to solve tactical planning problems in flexible manufacturing systems Atlihan, MK; Kayaligil, S; Erkip, N (1999-07-01) This paper is an attempt to develop a generic modeling framework that addresses tactical planning problems of flexible manufacturing systems in a coherent manner. We propose a generic 0-1 mixed integer programming formulation, that integrates batching, loading, and routing problems with their critical aspects related to a system's performance. For this purpose, a thorough analysis is made to determine and relate system components, their attributes, and alternatives together with performance measures specifi...
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. Karzan and M. Azizoğlu, “The tool transporter movements problem in flexible manufacturing systems,” INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, pp. 3059–3084, 2008, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/44257.