Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Minimizing the number of tool switching instants in Flexible Manufacturing Systems
Date
2008-12-01
Author
Konak, Abdullah
Kulturel-Konak, Sadan
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
204
views
0
downloads
Cite This
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.
Subject Keywords
Management Science and Operations Research
,
Economics and Econometrics
,
Industrial and Manufacturing Engineering
,
General Business, Management and Accounting
URI
https://hdl.handle.net/11511/41131
Journal
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
DOI
https://doi.org/10.1016/j.ijpe.2008.09.001
Collections
Department of Industrial Engineering, Article
Suggestions
OpenMETU
Core
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.
Analysis of an inventory system under supply uncertainty
Gullu, R; Onol, E; Erkip, N (Elsevier BV, 1999-03-20)
In this paper, we analyze a periodic review, single-item inventory model under supply uncertainty. The objective is to minimize expected holding and backorder costs over a finite planning horizon under the supply constraints. The uncertainty in supply is modeled using a three-point probability mass function. The supply is either completely available, partially available, or the supply is unavailable. Machine breakdowns, shortages in the capacity of the supplier, strikes, etc., are possible causes of uncerta...
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.
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...
Operational fixed interval scheduling problem on uniform parallel machines
Bekki, Oezguen Baris; Azizoğlu, Meral (Elsevier BV, 2008-04-01)
In this study, we address an operational fixed interval scheduling problem on uniform parallel machines. Our objective is to maximize the total weight of the jobs processed. We show that the problem is NP-hard in the strong sense and develop polynomial time algorithms for some special cases. We propose a branch and bound algorithm that employs dominance conditions and tight bounds. The results of our computational tests have revealed that the algorithm returns optimal solutions for problem instances with up...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. Konak, S. Kulturel-Konak, and M. Azizoğlu, “Minimizing the number of tool switching instants in Flexible Manufacturing Systems,”
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
, pp. 298–307, 2008, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/41131.