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
Cyclic scheduling of parts and robot moves in m-machine robotic cells
Date
2018-02-01
Author
GÜLTEKİN, HAKAN
Coban, Betul
Akhlaghi, Vahid Eghbal
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
193
views
0
downloads
Cite This
We consider a flow shop type manufacturing cell consisting of m machines and a material handling robot producing multiple parts. The robot transfers the parts between the machines and loads/unloads the machines. We consider the cyclic scheduling of the parts and the robot moves with the objective of maximizing the throughput rate. We develop a mixed integer linear programming formulation of the problem. The formulation is improved with several valid inequalities and reformulations of the constraints. We also develop a hybrid metaheuristic algorithm for this strongly NP-Hard problem. The algorithm is modified to handle both 1-unit and multi-unit robot cycles. Multi-threading is used to parallelize the algorithm in order to improve its efficiency. After calibrating the parameters of the heuristic algorithm, an extensive computational study is performed to evaluate its performance. The results of this study revealed that the developed heuristic provides near-optimal solutions in reasonable solution times. The effects of parallelization and the benefits of considering multi-unit cycles instead of 1-unit cycles are also quantified. Our computational tests show that multi-unit cycles improve the throughput rate by 9% on the average. The improvement can reach to 20% depending on the problem parameters.
Subject Keywords
Management Science and Operations Research
,
Modelling and Simulation
,
General Computer Science
URI
https://hdl.handle.net/11511/66829
Journal
COMPUTERS & OPERATIONS RESEARCH
DOI
https://doi.org/10.1016/j.cor.2017.09.018
Collections
Department of Industrial Engineering, Article
Suggestions
OpenMETU
Core
Considering manufacturing cost and scheduling performance on a CNC turning machine
Gürel, Sinan (Elsevier BV, 2007-02-16)
A well known industry application that allows controllable processing times is the manufacturing operations on CNC machines. For each turning operation as an example, there is a nonlinear relationship between the manufacturing cost and its required processing time on a CNC turning machine. If we consider total manufacturing cost (F-1) and total weighted completion time (F-2) objectives simultaneously on a single CNC machine, making appropriate processing time decisions is as critical as making job sequencin...
Assessing the benefits of remanufacturing option under one-way substitution and capacity constraint
Bayındır, Zeynep Pelin; Gullu, Refik (Elsevier BV, 2007-02-01)
In this article, we investigate the profitability of remanufacturing option when the manufactured and remanufactured products are segmented to different markets and the production capacity is finite. A single period profit model under substitution is constructed to investigate the system conditions under which remanufacturing is profitable. We present analytical findings and computational results to show profitability of remanufacturing option under substitution policy subject to a capacity constraint of th...
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...
Order-Preserving Languages for the Supervisory Control of Automated Manufacturing Systems
Nooruldeen, Anas; Schmidt, Klaus Verner (Institute of Electrical and Electronics Engineers (IEEE), 2020-01-01)
Automated manufacturing systems (AMSs) consist of computer-controlled interconnected manufacturing components (MCs) that are used to transport and process different product types. Each product type requires a certain sequence of processing steps in different MCs. Hereby, multiple product types can share processing steps on the same MC and the paths of different products types can overlap. In this paper we consider the modeling of AMSs in the scope of supervisory control for discrete event systems (DES). On ...
Integrated framework to investigate value innovations
Dikmen Toker, İrem; Birgönül, Mustafa Talat (American Society of Civil Engineers (ASCE), 2005-04-01)
A conceptual framework has been developed to investigate value innovations within construction companies. A visual metaphor has been defined to model the innovation system where the elements of the model are objectives, strategies, environmental barriers/drivers, and organizational factors. The major idea is that none of the elements of the model alone can explain the innovative capability, and elements as well as their interrelations should be considered concurrently to investigate how the innovation syste...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
H. GÜLTEKİN, B. Coban, and V. E. Akhlaghi, “Cyclic scheduling of parts and robot moves in m-machine robotic cells,”
COMPUTERS & OPERATIONS RESEARCH
, pp. 161–172, 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/66829.