Örnek, Mustafa Arslan
Loading...
Profile URL
Name Variants
Örnek, Arslan
Örnek, M. Arslan
Ornek, 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
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID
Sustainable Development Goals
Documents
53
Citations
429
h-index
14
Documents
31
Citations
315
Scholarly Output
24
Articles
13
Views / Downloads
0/0
Supervised MSc Theses
2
Supervised PhD Theses
0
WoS Citation Count
245
Scopus Citation Count
327
WoS h-index
10
Scopus h-index
12
Patents
0
Projects
0
WoS Citations per Publication
10.21
Scopus Citations per Publication
13.63
Open Access Source
4
Supervised Theses
2
| Journal | Count |
|---|
Current Page: 1 / NaN
Scopus Quartile Distribution
Competency Cloud
24 results
Scholarly Output Search Results
Now showing 1 - 10 of 24
Article Citation - WoS: 18Citation - Scopus: 25A Vehicle Scheduling Problem With Fixed Trips and Time Limitations(Elsevier Science Bv, 2009) Eliiyi Türsel, Deniz; Örnek, Mustafa Arslan; Karakutuk, Sadik SerhatWe 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.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 ArslanIn 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.Editorial Citation - WoS: 7Citation - Scopus: 9A Note on A Mixed Integer Programming Model for Advanced Planning and Scheduling (aps)(Elsevier Science Bv, 2010) Örnek, Mustafa Arslan; Özpeynirci, Selin; Ozturk, CemalettinIn a recent paper, Chen and Ji [Chen, K., Ji, P., 2007. A mixed integer programming model for advanced planning and scheduling (APS). European journal of Operational Research 181, 515-522] develop a mixed integer programming model for advanced planning and scheduling problem that considers capacity constraints and precedence relations between the operations. The orders require processing of several operations on eligible machines. The model presented in the above paper works for the case where each operation can be processed on only one machine. However, machine eligibility means that only a subset of machines are capable of processing a job and this subset may include more than one machine. We provide a general model for advanced planning and scheduling problems with machine eligibility. Our model can be used for problems where there are alternative machines that an operation can be assigned to. (C) 2009 Elsevier B.V. All rights reserved.Article Citation - WoS: 25Citation - Scopus: 33Simulation Analysis of Lot Streaming in Job Shops With Transportation Queue Disciplines(Elsevier Science Bv, 2009) Edis, Rahime Sancar; Ornek, ArslanIn 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.Conference Object Citation - Scopus: 2Cyclic Scheduling of Flexible Mixed Model Assembly Lines(IFAC Secretariat, 2013) Ozturk, Cemalettin; Tunali S.; Hnich B.; Örnek, Mustafa ArslanMixed 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.Conference Object Citation - Scopus: 1Integer Programming Model Formulations for Over Constrained Flight - Gate Assignment Problem(Universite de Lorraine, 2015) Ozturk, Cemalettin; Örnek, Mustafa Arslan; Sugut I.Flight - Gate assignment problems are complex real world problems involving different constraints. Some of these constraints include plane-gate eligibility, assigning planes of the same airline and planes getting service from the same ground handling companies to adjacent gates, buffers for changes in flight schedules, night stand flights, priority of some gates over others, and so on. In literature there are models to solve this highly complicated problem and tackle its complexity. In this study, we propose two different Integer programming (IP) models, namely, timetabling and assignment based models to solve the problem to optimality. These models prove to be highly efficient in that the computational times are quite short. We also provide the results for one day operation of an airport using real world data. Although, the research is still in progress, in the final section we present our conclusions based on our study done so far.Article Citation - WoS: 9Citation - Scopus: 11Determining Optimum (s, S) Levels of Floor Stock Items in a Paint Production Environment(Elsevier, 2015) Yetkin Ekren, Banu; Örnek, Mustafa ArslanIn this paper, we develop an (s, S) inventory model to determine inventory levels of floor stock items (FSIs) in a manufacturing company producing paint products. FSIs are raw materials that are transferred from the main warehouse to be stored at the periphery of production area for a temporary period of time to be used in the manufacturing process. These items are commonly and frequently used materials during production; hence the optimum inventory levels of these materials to be carried in the floor stock storage areas (FSSAs) to prevent costly interruptions in the manufacturing processes should be determined. We model the problem as a multi-item, single-echelon (s, S) inventory policy where items can be stored in stocking locations that are supplied by an indoor vendor (i.e., the main warehouse) with infinite capacity. The objective is to minimize the average number of daily replenishments dispatched from the main warehouse subject to the capacity of FSSAs and satisfying a pre-defined fill rate. We consider stochastic demand and lead time, and use simulation for the optimization purpose. Finally, we present and discuss the numerical results of the study along with our conclusions. (C) 2015 Elsevier B.V. All rights reserved.Article Citation - Scopus: 17Simultaneous Balancing and Scheduling of Flexible Mixed Model Assembly Lines With Sequence-Dependent Setup Times(2010) Ozturk, Cemalettin; Tunali S.; Hnich B.; Örnek, Mustafa ArslanWe consider Simultaneous Balancing and Scheduling of Flexible Mixed Model Assembly Lines with Sequence-Dependent Setup Times (SBSFMMAL-SDST). We propose alternate Mixed Integer Programming (MIP) and Constraint Programming (CP) formulations. Our experiments show that while the MIP models could not solve relatively small instances, the CP approach seems more promising. © 2010.Article Citation - WoS: 33Citation - Scopus: 35Cyclic Scheduling of Flexible Mixed Model Assembly Lines With Parallel Stations(Elsevier Sci Ltd, 2015) Ozturk, Cemalettin; Tunali, Semra; Hnich B.; Örnek, Mustafa ArslanIn 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.Article Citation - WoS: 18Citation - Scopus: 22Capacitated Lot Sizing With Linked Lots for General Product Structures in Job Shops(Pergamon-Elsevier Science Ltd, 2010) Ozturk, Cemalettin; Örnek, Mustafa ArslanIn this paper, we propose a mixed integer programming (MIP) model for a multi-level multi resource capacitated lot sizing and scheduling problem with a set of constraints to track dependent demand balances, that is, the amount left over after allocating the available inventory to the dependent demands. A part of this leftover amount may be kept as a reservation quantity to meet dependent demands of the following period under capacity restrictions. These constraints are necessary because we assume independent demands as well as dependent demands for all items in the product structure. They also are used to tighten the domain of on hand and backorder inventory levels. Although we allow backorders for independent demands only, this is not possible for dependent demands as backorders will disturb the whole demand balance of the product structure. Determination of setup costs is a crucial task when developing lot sizing and scheduling models, especially in a capacitated manufacturing environment with backorders. In this respect, the capacitated lot sizing with linked lot sizes (CLSPL) model we formulate needs not to consider setup costs to avoid unnecessary setups thanks to the new set of constraints, and to obtain feasible lot sizes and schedules. Finally, a numerical example and computational results in a job shop environment are also given, and future research directions are provided. (C) 2009 Elsevier Ltd. All rights reserved.
- «
- 1 (current)
- 2
- 3
- »