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
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
Part selection problem in disassembly systems
Download
index.pdf
Date
2006
Author
Yetere, Ayça
Metadata
Show full item record
Item Usage Stats
104
views
29
downloads
Cite This
In this study, we consider the disassembly problem of end-of-life (EOL) products for recovering valuable parts or assemblies. All parts obtained by disassembly processes of an EOL product may not be profitable due to their high recovery costs. Our problem is to select the parts to be released and determine the associated disassembly tasks so as to maximize the total profit. We first tackle the simple part selection problem, and then introduce a time constraint for the tasks to be performed for selected parts and search for incomplete time constrained sequences. We formulate our first problem as a Mixed Integer Problem and show that the constraint set of this formulation is totally unimodular. We also provide the dual formulation of our problem and its interpretation. For time-constrained part selection problem we propose a branch-and-bound algorithm. We first develop some reduction mechanism to reduce the size of the problem. Our solution procedure is capable of solving problems with up to 94 parts and tasks.
Subject Keywords
Operations research.
,
System analysis.
URI
http://etd.lib.metu.edu.tr/upload/12607099/index.pdf
https://hdl.handle.net/11511/15791
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Capacity and tool allocation problem in flexible manufacturing systems
Bilgin, S.; Azizoğlu, Meral (Informa UK Limited, 2006-06-01)
This study addresses an allocation problem that arises in the semiconductor industry and flexible manufacturing systems where the tools should be loaded on computer numerical controlled (CNC) machines to process a number of operations. The time and tool magazine capacities of the CNC machines and the number of available tools of each type are limited. The objective is to maximize the total weight of operation assignments. We present a mixed integer programming formulation of the problem and show that the pr...
Bounding procedures on bi-directional labeling algorithm of tdvrptw in branch-and-cut-and-price framework
Kökten, Selen; İyigün, Cem; Woensel, Tom Van; Department of Industrial Engineering (2011)
In this thesis we consider a Time-Dependent Vehicle Routing Problem with Time Windows (TDVRPTW) which is solved by a Branch and Cut and Price (BCP) algorithm. The decomposition of an arc based formulation leads to a set-partitioning problem as the master problem, and a Time-Dependent Elementary Shortest Path Problem with Resource Constraints (TDESPPRC) as the pricing problem. The main contribution of this thesis is the modified fathoming and bounding procedures applied on bi-directional Time-Dependent Label...
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...
A disassembly line balancing problem with fixed number of workstations
Kalaycilar, Eda Goksoy; Azizoğlu, Meral; Yeralan, Sencer (2016-03-01)
In this study, a Disassembly Line Balancing Problem with a fixed number of workstations is considered. The product to be disassembled comprises various components, which are referred to as its parts. There is a specified finite supply of the product to be disassembled and specified minimum release quantities (possible zero) for each part of the product. All units of the product are identical, however different parts can be released from different units of the product. There is a finite number of identical w...
Fault Tolerance Capabilities of Three, Four and Six-Phase Configurations of a 24 Slot Modular PMSM
Bayazıt, Göksenin Hande; Keysan, Ozan (2019-07-01)
In this study, fault tolerance and redundancy capabilities of different phase and winding configurations of an Integrated Modular Motor Drive (IMMD) system are investigated. This is made possible by manipulating gate drive signals of the inverter and phase connections. Three and four phase connections as well as symmetric and asymmetric six-phase topologies are described. Control strategies and redundancy possibilities of these different topologies under an open circuit fault condition are examined in MATLA...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. Yetere, “Part selection problem in disassembly systems,” M.S. - Master of Science, Middle East Technical University, 2006.