Örnek, Mustafa Arslan

Profile Picture
Profile URL
https://hdl.handle.net/20.500.14365/7203
Name Variants
Örnek, Arslan
Örnek, M. Arslan
Ornek, Arslan
Job Title
Email Address
arslan.ornek@ieu.edu.tr
Main Affiliation
05.09. Industrial Engineering
Status
Former Staff
Website
ORCID ID
https://orcid.org/0000-0002-8612-5183
Scopus Author ID
55926629500
Turkish CoHE Profile ID
9A1C630CD8F5D521
Google Scholar ID
WXByY7gAAAAJ
WoS Researcher ID
A-5643-2009

Sustainable Development Goals

NO POVERTY1
NO POVERTY
0
Research Products
ZERO HUNGER2
ZERO HUNGER
0
Research Products
GOOD HEALTH AND WELL-BEING3
GOOD HEALTH AND WELL-BEING
0
Research Products
QUALITY EDUCATION4
QUALITY EDUCATION
0
Research Products
GENDER EQUALITY5
GENDER EQUALITY
0
Research Products
CLEAN WATER AND SANITATION6
CLEAN WATER AND SANITATION
0
Research Products
AFFORDABLE AND CLEAN ENERGY7
AFFORDABLE AND CLEAN ENERGY
0
Research Products
DECENT WORK AND ECONOMIC GROWTH8
DECENT WORK AND ECONOMIC GROWTH
0
Research Products
INDUSTRY, INNOVATION AND INFRASTRUCTURE9
INDUSTRY, INNOVATION AND INFRASTRUCTURE
6
Research Products
REDUCED INEQUALITIES10
REDUCED INEQUALITIES
0
Research Products
SUSTAINABLE CITIES AND COMMUNITIES11
SUSTAINABLE CITIES AND COMMUNITIES
2
Research Products
RESPONSIBLE CONSUMPTION AND PRODUCTION12
RESPONSIBLE CONSUMPTION AND PRODUCTION
0
Research Products
CLIMATE ACTION13
CLIMATE ACTION
0
Research Products
LIFE BELOW WATER14
LIFE BELOW WATER
0
Research Products
LIFE ON LAND15
LIFE ON LAND
0
Research Products
PEACE, JUSTICE AND STRONG INSTITUTIONS16
PEACE, JUSTICE AND STRONG INSTITUTIONS
0
Research Products
PARTNERSHIPS FOR THE GOALS17
PARTNERSHIPS FOR THE GOALS
0
Research Products
Documents

53

Citations

429

h-index

14

Go to Scopus profile
Documents

31

Citations

315

Go to WoS profile
Scholarly Output

25

Articles

13

Views / Downloads

73/100

Supervised MSc Theses

2

Supervised PhD Theses

0

WoS Citation Count

245

Scopus Citation Count

328

Patents

0

Projects

0

WoS Citations per Publication

9.80

Scopus Citations per Publication

13.12

Open Access Source

4

Supervised Theses

2

JournalCount
Sımulatıon Modellıng Practıce And Theory3
24th Mini EURO Conference on Continuous Optimization and Information-Based Technologies in the Financial Sector, MEC EurOPT 20102
Computers & Industrıal Engıneerıng2
IFAC Proceedings Volumes (IFAC-PapersOnline)2
Internatıonal Journal of Advanced Manufacturıng Technology2
Current Page: 1 / 4

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Scholarly Output Search Results

Now showing 1 - 10 of 25
  • Thumbnail Image
    Article
    Citation - WoS: 18
    Citation - Scopus: 25
    A Vehicle Scheduling Problem With Fixed Trips and Time Limitations
    (Elsevier Science Bv, 2009-01) Eliiyi Türsel, Deniz; Örnek, Mustafa Arslan; Karakutuk, Sadik Serhat
    We consider minimum-cost scheduling of different vehicle types on a predetermined set of one-way trips. Trips have predetermined ready times, deadlines and associated demands. All trips Must be performed. The total time of operations on any vehicle is limited. We develop a mixed integer model to find the optimal number of vehicles at a minimum cost. Based on the hard nature of the problem, we propose six heuristics. Computational results reveal that heuristics return exceptionally good solutions for problem instances with up to 100 jobs in very small computation times, and are likely to perform well for larger instances. (C) 2008 Elsevier B.V. All rights reserved.
  • Thumbnail Image
    Conference Object
    A Mixed Integer Programming Model for Multi-Period Dyeing and Batching Problem in a Yarn Plant
    (Computers and Industrial Engineering, 2014) Ozturk, Cemalettin; Örnek, Mustafa Arslan
    In a so-called multi-period yarn dyeing and batching problem, we try to determine the optimal batching of customer orders to be dyed in dye machines in each shift to minimize total lateness and earliness costs. In addition to weight, production quantity and volume capacity of the machines, there is a set of technical dyeing interaction constraints such as flotte, colour types, colour percentages and chemical recipe of customer orders when yarns are immersed in a large vat of coloured water known as the dye-liquor that includes dyestuffs, plus a range of chemicals to assist the dyeing process in the same shift. Furthermore, because of multi-period multi-shift nature of the problem, there is a setup carryover restriction which enforces that from shift to shift the colours must be processed in the increasing degree of darkness, i.e., in technical terms, the colour percentage of the batch increases. To the best of our knowledge, there is no study in the literature to solve this combinatorial optimization problem. Hence, in this paper, we first develop a novel mixed integer programming (MIP) formulation and then, we present a case study in a worldwide known yarn manufacturing company.
  • Thumbnail Image
    Conference Object
    Citation - Scopus: 2
    Cyclic Scheduling of Flexible Mixed Model Assembly Lines
    (IFAC Secretariat, 2013) Ozturk, Cemalettin; Tunali S.; Hnich B.; Örnek, Mustafa Arslan
    Mixed model assembly lines are used to produce multiple copies of given minimum part set (MPS). Considering only one copy (cycle) of the MPS while solving the mixed-model balancing and scheduling problem yields suboptimal solutions since blocking and idle times of stations between repeated copies are ignored. Modeling and solving this problem in a cyclic manner can significantly overcome these inefficiencies and improve the throughput of the line. In this paper, after investigating the nature of the problem, we propose exact and heuristic methods for practical applications and evaluate their performances on various size test instances. © IFAC.
  • Thumbnail Image
    Conference Object
    Citation - Scopus: 2
    Simultaneous Balancing and Scheduling of Flexible Mixed Model Assembly Lines With Sequence Dependent Task Time Increments
    (Vilnius Gediminas Technical University, 2010) Ozturk, Cemalettin; Tunali S.; Hnich B.; Örnek, Mustafa Arslan
    General tendency in mixed model assembly line literature is to separate balancing and model sequencing decisions to different time frames. However, today's competitive market conditions force decision makers to respond quickly to changing demand patterns. Therefore, assembly line balancing and mixed model sequencing problems should be considered together. In this paper, we state the problem structure with sequence dependent task time increments and flexibility in task assignment. Furthermore, we compare the performance of two approaches which are proposed to solve the stated problem by using various problem instances. © Izmir University of Economics, Turkey, 2010.
  • Thumbnail Image
    Article
    Citation - WoS: 25
    Citation - Scopus: 33
    Simulation Analysis of Lot Streaming in Job Shops With Transportation Queue Disciplines
    (Elsevier Science Bv, 2009-02) Edis, Rahime Sancar; Ornek, Arslan
    In this paper we Study a multi-product lot streaming problem in a stochastic job shop with equal and discrete sublots. The problem involves splitting order quantities of different products into different number of equal sublots (NES) and analyzing the effects of sublot-related transportation queue disciplines (TRQD) for different performance measures. Our simulation results show that some combination of TRQD and NES alternatives are appropriate for some performance Measures. We also propose a simple heuristic to determine the NES of each product type to further improve the values of performance measures. (C) 2008 Elsevier B.V. All rights reserved.
  • Thumbnail Image
    Article
    Citation - WoS: 13
    Citation - Scopus: 17
    Operational Extended Model Formulations for Advanced Planning and Scheduling Systems
    (Elsevier Science Inc, 2014-01) Ozturk, Cemalettin; Örnek, Mustafa Arslan
    Since the basic reasoning of Manufacturing Resources Planning (MRPII) systems is flawed, a new breed of concepts called Advanced Planning and Scheduling systems CAPS) have recently emerged to overcome the problems occurring on the shop floor. In this study, we develop improved and extended mixed integer programming formulations for APS systems at the factory planning level. First, we develop a basic model which explicitly considers capacity constraints, operation sequences, processing times, and due dates in a multi-machine, multi-order, multi-item environment where an item can be processed on a given set of eligible machines. The extensions to the basic model include sequence dependent setups, and transfer times between machines. We also show that our model with a little modification could be used to quote delivery times for customer orders in case due dates are not specified. We provide numerical examples and our conclusions along with future research directions. (C) 2013 Elsevier Inc. All rights reserved.
  • Thumbnail Image
    Article
    Citation - WoS: 23
    Citation - Scopus: 33
    A Simulation Based Experimental Design To Analyze Factors Affecting Production Flow Time
    (Elsevier Science Bv, 2008-03) Yetkin Ekren, Banu; Örnek, Mustafa Arslan
    In this paper we analyze and evaluate the effects of some pre-defined process parameters on the performance of a manufacturing system. These parameters include two different plant layout types, namely functional layout (FL) and cellular manufacturing layout (CL), as well as scheduling rule, machine downtimes, batch sizes, and transporter (interstage transporters) capacities. First we employ simulation to evaluate the effects of these factors on the performance of the system and then conduct designed experiments to set the best levels for these factors. The performance evaluation function is defined in terms of the average flow time of all the part types through the manufacturing system. Arena 10.0 simulation software and SPSS 9.0 statistical package are used to measure the main effects and interactions between these factors. This work demonstrates that various manufacturing parameters should be considered jointly when designing or redesigning a facility because setting different levels for parameters can considerably affect the performance of a facility. (C) 2007 Elsevier B.V. All rights reserved.
  • Thumbnail Image
    Article
    Citation - WoS: 33
    Citation - Scopus: 35
    Cyclic Scheduling of Flexible Mixed Model Assembly Lines With Parallel Stations
    (Elsevier Sci Ltd, 2015-07) Ozturk, Cemalettin; Tunali, Semra; Hnich B.; Örnek, Mustafa Arslan
    In this paper, the problem of balancing and cyclic scheduling of flexible mixed model assembly lines with parallel stations is studied. To exploit the connection between balancing and cyclic scheduling problems for an efficient line management, they are considered simultaneously. A novel constraint programming model including problem specific symmetry breaking constraints is proposed to solve this problem. Experiments on extensive number of test instances with various sizes are also presented. (C) 2015 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.
  • Thumbnail Image
    Article
    Citation - WoS: 19
    Citation - Scopus: 24
    Balancing and Scheduling of Flexible Mixed Model Assembly Lines With Parallel Stations
    (Springer London Ltd, 2012-12-14) Ozturk, Cemalettin; Tunali, Semra; Hnich B.; Örnek, Mustafa Arslan
    In this paper, we study flexible mixed model assembly lines with serially connected stages where stages may have one or more parallel stations. Station parallelism in flexible mixed model assembly lines improves system reliability and enables rapid adaptability to customer demand fluctuations. However, in order to effectively manage such lines under real-world conditions, there is a need to extend traditional assembly line management methods. This study extends the current research by simultaneously considering the problems of task assignment and model scheduling on parallel stations. Furthermore, scheduling of assigned tasks on each station is considered. We formulate the problem context first as a mixed integer programming model and then develop a decomposition scheme for large scale applications. Finally, we compare the performance of the proposed model and decomposition scheme using various size test instances.
  • Thumbnail Image
    Article
    Citation - WoS: 16
    Citation - Scopus: 19
    Optimisation and Constraint Based Heuristic Methods for Advanced Planning and Scheduling Systems
    (University of Cincinnati, 2016) Ozturk, Cemalettin; Örnek, Mustafa Arslan
    Manufacturing Resources Planning (MRPII) systems are unable to prevent capacity problems occurring on the shop floor because of the fixed lead time and backward scheduling logic. For this reason, a new breed of concepts called APS (Advanced Planning and Scheduling) systems emerged which include finite capacity planning at the shop floor level through constraint based planning. In this paper, we present a Constraint Programming (CP) model to show how optimization models could be used in this context. We also present a two phase heuristic to solve this complicated APS problem. While jobs are assigned to the best eligible machines to smooth the workload on the machines in the first phase, a constraint based scheduling heuristic schedules jobs once they are assigned to eligible machines in the second phase. We provide numerical tests and discuss the results for both the model and the heuristic. The concluding remarks and suggestions for future research are stated in the final section of the paper. © International Journal of Industrial Engineering.