Researcher:
Gökgür, Burak

Profile Picture
ORCID

Job Title

PhD Student

First Name

Burak

Last Name

Gökgür

Name

Name Variants

Gökgür, Burak

Email Address

Birth Date

Filters

2015 - 20183

Advanced Search

Filter by

Settings

Researcher Of Publications: search.filters.isAuthorOfPublication.e95f239a-27d9-44ba-8384-b8328172cf1b

Search Results

Now showing 1 - 3 of 3
  • Placeholder
    PublicationMetadata only
    Parallel machine scheduling with tool loading: a constraint programming approach
    (Taylor & Francis Ltd, 2018) Hnich, Brahim; Ozpeynirci, Selin; Gökgür, Burak; PhD Student; Graduate School of Business; 181004
    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.
  • Placeholder
    PublicationMetadata only
    Large-scale disassembly operations planning with parallel resources
    (Springer, 2015) N/A; Gökgür, Burak; PhD Student; Graduate School of Business; 181004
    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.
  • Placeholder
    PublicationMetadata only
    Parallel machine scheduling with tool loading
    (Elsevier Science Inc, 2016) Özpeynirci, Selin; Hnich, Brahim; N/A; Gökgür, Burak; PhD Student; Graduate School of Business; 181004
    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.