Gökgür, Burak

Profile Picture
Profile URL
https://hdl.handle.net/20.500.14365/7367
Name Variants
Gokgur, Burak
Job Title
Email Address
burak.gokgur@ieu.edu.tr
Main Affiliation
05.09. Industrial Engineering
Status
Former Staff
Website
ORCID ID
0000-0001-7384-2856
Scopus Author ID
55735526000
Turkish CoHE Profile ID
3941889D03F00986
Google Scholar ID
bsMrS0oAAAAJ
WoS Researcher ID
V-8502-2019

Sustainable Development Goals

10

REDUCED INEQUALITIES
REDUCED INEQUALITIES Logo

0

Research Products

14

LIFE BELOW WATER
LIFE BELOW WATER Logo

0

Research Products

16

PEACE, JUSTICE AND STRONG INSTITUTIONS
PEACE, JUSTICE AND STRONG INSTITUTIONS Logo

0

Research Products

17

PARTNERSHIPS FOR THE GOALS
PARTNERSHIPS FOR THE GOALS Logo

0

Research Products

11

SUSTAINABLE CITIES AND COMMUNITIES
SUSTAINABLE CITIES AND COMMUNITIES Logo

0

Research Products

9

INDUSTRY, INNOVATION AND INFRASTRUCTURE
INDUSTRY, INNOVATION AND INFRASTRUCTURE Logo

2

Research Products

2

ZERO HUNGER
ZERO HUNGER Logo

0

Research Products

1

NO POVERTY
NO POVERTY Logo

0

Research Products

13

CLIMATE ACTION
CLIMATE ACTION Logo

0

Research Products

7

AFFORDABLE AND CLEAN ENERGY
AFFORDABLE AND CLEAN ENERGY Logo

0

Research Products

8

DECENT WORK AND ECONOMIC GROWTH
DECENT WORK AND ECONOMIC GROWTH Logo

0

Research Products

3

GOOD HEALTH AND WELL-BEING
GOOD HEALTH AND WELL-BEING Logo

0

Research Products

15

LIFE ON LAND
LIFE ON LAND Logo

0

Research Products

4

QUALITY EDUCATION
QUALITY EDUCATION Logo

0

Research Products

6

CLEAN WATER AND SANITATION
CLEAN WATER AND SANITATION Logo

0

Research Products

5

GENDER EQUALITY
GENDER EQUALITY Logo

0

Research Products

12

RESPONSIBLE CONSUMPTION AND PRODUCTION
RESPONSIBLE CONSUMPTION AND PRODUCTION Logo

0

Research Products
Documents

12

Citations

128

h-index

4

Go to Scopus profile
Documents

0

Citations

0

Go to WoS profile
Scholarly Output

9

Articles

5

Views / Downloads

0/0

Supervised MSc Theses

1

Supervised PhD Theses

0

WoS Citation Count

90

Scopus Citation Count

102

WoS h-index

2

Scopus h-index

3

Patents

0

Projects

0

WoS Citations per Publication

10.00

Scopus Citations per Publication

11.33

Open Access Source

4

Supervised Theses

1

JournalCount
24th Mini EURO Conference on Continuous Optimization and Information-Based Technologies in the Financial Sector, MEC EurOPT 20101
Applıed Mathematıcal Modellıng1
Expert Systems with Applications1
Gazı Unıversıty Journal of Scıence1
ICORES 2013 - Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems1
Current Page: 1 / 2

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Filters

2010 - 201972020 - 20262
Reset filters

Settings

Scholarly Output Search Results

Now showing 1 - 9 of 9
  • Thumbnail Image
    Conference Object
    Citation - WoS: 2
    An Assignment and Routing Problem With Time Windows and Capacity Restriction
    (Elsevier Science Bv, 2012) Ozdemirel, Aybike; Gokgur, Burak; Eliiyi Türsel, Deniz
    In under-developed or developing countries, the needs of indigent population are of a pressing nature most of the time. One of the objectives of municipal authorities is to collect donations and distribute the donated items and funds to indigent residents. This task requires a good matching of donations and needs for effectively meeting the needs of recipients. The distribution route is also important for time/cost-effective operations. This study presents a mixed integer programming model that integrates these matching and routing problems. Because of the humanitarian nature of the problem, the main objective is to maximize the utility of the assignment of the donated items. There are several criteria regarding donations and recipients that affect the utility of an assignment, such as the travel time between the location of the donation and the candidate recipient, income level, age, and the number of household of the candidate recipient, the recipient's previous usage of this service, and the age of donated item. Priorities among criteria are set by making a series of judgments based on pairwise comparisons as in the Analytical Hierarchy Process. We consider a real life problem for a district in Izmir, Turkey. The planning period is taken as a working day, and there are time windows in which donors and residents are willing to be served, i.e., the donor must be visited on a specified time interval during the working day. A single truck with a limited capacity is to distribute the donations. The output of the mathematical model is the optimal assignment of the items and the visiting sequence of individuals to maximize total utility. We present our model along with numerical examples and results. (C) 2012. The authors. Published by Elsevier Ltd. Selection and/or peer-review under responsibility of the Program
  • Thumbnail Image
    Article
    Citation - WoS: 48
    Citation - Scopus: 58
    Parallel Machine Scheduling With Tool Loading: a Constraint Programming Approach
    (Taylor & Francis Ltd, 2018) Gokgur, Burak; Hnich, Brahim; Özpeynirci, Selin
    This paper presents constraint programming models that aim to solve scheduling and tool assignment problems in parallel machine environments. There are a number of jobs to be processed on parallel machines. Each job requires a set of tools, but limited number of tools are available in the system due to economic restrictions. The problem is to assign the jobs and the required tools to machines and to determine the schedule so that the makespan is minimised. Three constraint programming models are developed and compared with existing methods described in the literature.
  • Thumbnail Image
    Conference Object
    Scheduling With Tool Switching in Flexible Manufacturing Systems
    (2013) Özpeynirci, Selin; Gökgür, Burak
    In our problem, there are a number of jobs to be processed on parallel computer numerically controlled machines. Each job requires a set of tools and the required tools must be loaded to process the jobs. The machines have limited tool magazine capacities and the number of tools available in the system is limited due to economic restrictions, which leads to the need for switching tools. We assume that the tool switching time constitutes a significant portion of total processing time and does not depend on the number or type of tools changed. The problem is to assign the jobs and the required tools to machines and determine the schedule so that the makespan is minimized. A mathematical model and a heuristic approach based on the decomposition of the problem are developed.
  • Thumbnail Image
    Article
    Citation - WoS: 2
    Citation - Scopus: 3
    Large-Scale Disassembly Operations Planning With Parallel Resources
    (Springer London Ltd, 2015) Gokgur, Burak; Gökçe, Mahmut Ali; Özpeynirci, Selin
    Disassembly systems obtain valuable parts from end-of-life products to remanufacture, reuse, or recycle them. This study deals with disassembly scheduling and presents a novel mixed integer programming model. Disassembly scheduling is the problem of determining quantity and schedule of items disassembled, held in inventory, sold, and disposed on capacitated resources over a planning horizon while satisfying at least a given service level. The model presented here includes a number of novelties including assignment of disassembly operations to parallel capacitated resources, consideration of costs to environment and demand for each level of items. We also present a problem testbed to be used for comparison of different algorithms and the generation mechanism. Results from a large experimental design using problem testbed are presented.
  • Thumbnail Image
    Article
    Cooperative Scheduling and Subcontracting Strategies for Products with Yield Decay: A Mixed-Integer Programming Approach
    (Pergamon-Elsevier Science Ltd, 2026) Gokgur, Burak; Ozpeynirci, Selin; Tanil, Mutlu Ipek
    This study introduces a mixed-integer programming framework to analyze cooperative scheduling and outsourcing decisions for perishable products affected by yield decay. We study two manufacturers that share a subcontractor, operate under sequence-dependent setup times, and aim to schedule their operations to maximize profit. Three subcontracting strategies are assessed: no subcontracting, non-cooperative subcontracting, and cooperative scheduling. Our illustrative example and extensive numerical experiments across 18 scenarios demonstrate notable efficiency gains. Cooperation improves total supply chain profit by 4.55 % under low setup times and up to 147.37 % under high setup times. Changes in subcontractor costs cause asymmetric profit redistributions, with decreases of 19.6 % for the lead firm and increases of 47.4 % for the follower in the Principal-Agent framework. When tardiness penalties are high, cooperation improves profit by 30.2 % compared to non-cooperation. A probabilistic analysis of subcontractor access indicates that total supply chain profit peaks when the follower has priority, despite this conflicting with individual firm incentives. Conditional Value-at-Risk analysis emphasizes the asymmetric downside risks of decentralization, with one firm being more vulnerable in worst-case scenarios. Overall, these findings highlight the benefits of cooperative subcontracting and underscore the importance of incentive-compatible contracts and risk-sharing mechanisms in shared-capacity environments with time-sensitive yield decay.
  • Thumbnail Image
    Article
    Citation - WoS: 1
    Minimization of Number of Tool Switching Instants in Automated Manufacturing Systems
    (Gazi Univ, 2022) Gokgur, Burak; Özpeynirci, Selin
    This study addresses the problem of minimizing tool switching instants in automated manufacturing systems. There exist a single machine and a group of jobs to be processed on it. Each job requires a set of tools, and due to limited tool magazine capacity, and because it is not possible to load all available tools on the machine, tools must be switched. The ultimate goal, in this framework, is to minimize the total number of tool switching instants. We provide a mathematical programming model and two constraint programming models for the problem. Because the problem is proven to be NP-hard, we develop two heuristic approaches, and compare their performance with methods described in the literature. Our analysis indicates that our constraint programming models perform relatively well in solution quality and execution time in small-sized problem instances. The performance of our greedy approach shows potential, reaching the optimal solution in 82.5% of instances. We also statistically demonstrate that the search algorithm enhances the quality of the solution obtained by the greedy heuristic, particularly in large sets. Hence, the solution approach, i.e., the greedy heuristic and the search algorithm proposed in this study is able to quickly reach near-optimal solutions, showing that the method is appropriate for manufacturing settings requiring sudden adjustments.
  • Thumbnail Image
    Master Thesis
    Disassembly Scheduling on Parallel Resource Environment
    (İzmir Ekonomi Üniversitesi, 2013) Gökgür, Burak; Gökçe, Mahmut Ali; Özpeynirci, Selin
    Demontaj sistemleri, hurda veya atık ürünlerden üretimde tekrar kullanılabilecek, geri dönüştürülebilecek ürünleri elde etmek için tasarlanmış sistemlerdir. Zararlı parçaların ve içeriklerin ayrılması işlemleri de demontaj sistemlerinde yapılmaktadır. Demontaj sistemleri dahilinde iki farklı ana konu bulunmaktadır. Bu konular demontaj planlama ve demontaj çizelgelemedir. Demontaj planlamanın amacı, demontajın en iyi yapılma sırasını bulmaktır. Demontaj çizelgeleme ise, belirlenen amaç fonksiyonuna göre planlama ufku içerisinde hangi ürünün, hangi zamanda, kaç tane parçalanacağını bulmayı hedefler. Tezin iki ana amacı bulunmaktadır. Birinci amacı, demontaj çizelgeleme literatüründe bulunan modeller dışında, farklı etmenleri de göz önünde bulunduran matematiksel model geliştirmektir. Tezde, değerlendirilen ve şu ana kadar literatürde çalışılmamış belirgin etmenler ise; ürünlerin imha edilmesi, minimum sipariş karşılama oranı, demontaj sistemlerinin çoklu kaynak ortamında kullanılması ve her bir parça için talep olmasıdır. İkinci amacı ise test problemi yaratma mekanizması geliştirmek ve problemin karakteristik özelliklerini gösterecek geniş test problemleri yaratmaktır. Geliştirilen problem yaratma mekanizması ile matematiksel modelin performansı ölçülmüştür.
  • Thumbnail Image
    Article
    Citation - WoS: 37
    Citation - Scopus: 41
    Parallel Machine Scheduling With Tool Loading
    (Elsevier Science Inc, 2016) Özpeynirci, Selin; Gokgur, Burak; Hnich, Brahim
    This paper presents a mixed integer programming approach that integrates the tool assignment and scheduling problems arising in parallel machine environments. There are a number of operations to be processed on parallel machines. Each operation requires a set of tools; however, the number of available tools are limited. Our objective is to minimize the makespan, i.e. the completion time of the final operation. We propose two different mathematical programming models for this problem. Since the problem is strongly NP hard in general, finding the optimal solution requires extremely long computational times as the problem size increases. We therefore develop a tabu search algorithm in order to find near-optimal solutions within reasonable times. (C) 2016 Elsevier Inc. All rights reserved.
  • Thumbnail Image
    Conference Object
    Production Planning and Control at an Integrated Poultry Organization
    (Vilnius Gediminas Technical University, 2010) Gökçe M.A.; Gökgür, Burak; Elverdi E.; Er E.; Gördesli T.
    This paper deals with a production planning problem in one of the largest poultry companies in Turkey, which includes determination of minimum number of pullet to be clipped and minimum amount of remnant for products with weight specifications for daily demand. The problem is challenging owing to the fact that each pullet can be clipped in a number of ways, producing different products with varying weights and quantities, from which demand has to be satisfied. We propose a mixed integer linear programming (MIP) model with input analysis. We try to satisfy demands fully and we determine type of pullets which are needed to clip for satisfying weighted demands. Several experimental tests are reported with real data from the company in order to see that whether developed model and solving approaches reflects the real system or not. © Izmir University of Economics, Turkey, 2010.