Detaylı Arama
İptal
Bulunan: 39 Adet 0.001 sn
- Eklemek veya çıkarmak istediğiniz kriterleriniz için 'Dahil' / 'Hariç' seçeneğini kullanabilirsiniz. Sorgu satırları birbirine 'VE' bağlacı ile bağlıdır.
- İptal tuşuna basarak normal aramaya dönebilirsiniz.
Filtreler
Filtreler
Bulunan: 39 Adet 0.001 sn
İlgili Araştırmacılar : Oğuzhan Ahmet ARIK ✕
Koleksiyon [3]
İlgili Araştırmacılar [3]
Tam Metin [2]
Tür [4]
Yazar [3]
Alt Tür [2]
Alt Tür 1 [2]
Konu Başlıkları [20]
Açık Erişim Tarihi [1]
Tarih [5]
Dizin Platformu [4]
İsmi Geçen [8]
WOS Kategorileri [8]
Doç. Dr. Oğuzhan Ahmet ARIKEndüstri Mühendisliği
Erişime Açık

Goal programming approach for carrying people with physical disadvantages

Oğuzhan Ahmet ARIK | Erkan KÖSE | Gülçin CANBULUT

Most of today's optimization efforts aim to reduce costs, time or the number of resources used. However, optimization efforts should consider other factors as important as these, such as facilitating the lives of the disabled, elderly and pregnant and helping them in their daily lives. In this study, the Nuh Naci Yazgan (NNY) University (Kayseri/Turkey) personnel transport problems were discussed. The NNY University provides a shuttle service to bring employees to school at the start of the work and to leave them at home after work. In order to shorten the collection / distribution time and th ...Daha fazlası

Makale/Derleme 2020 Promet - Trafic&Transportation 7 Görüntülenme
Erişime Açık

Single machine earliness/tardiness scheduling problem with grey processing times and the grey common due date

Oğuzhan Ahmet ARIK

Purpose – This paper presents a mixed-integer programming model for a single machine earliness/tardiness scheduling problem where the objective is to minimize total earliness/tardiness duration when the uncertainty of parameters such as processing times and due date is coded with grey numbers. Design/methodology/approach – Grey theory and grey numbers are used for illustrating the uncertainty of parameters in processing times and common due date, where the objective is to minimize the total earliness/ tardiness duration. The paper proposes a 0–1 mathematical model for the problem and an effect ...Daha fazlası

Makale/Derleme 2020 Grey Systems: Theory and Applications 11 Görüntülenme
Erişime Açık

Artificial bee colony algorithm ıncluding some components of ıterated greedy algorithm for permutation flow shop scheduling problems

Oğuzhan Ahmet ARIK

The permutation flow shop scheduling problem has been investigated by researchers for more than 40 years due to its complexity and lots of real-life examples of the problem. Many exact or approximate solution approaches have been presented for the problem. Among solution approaches in the literature, iterated greedy algorithm and its variants are the most effective solution methods for the problem. This paper proposes a hybrid solution algorithm that uses the best components such as local search operators and destruction/construction operators of the variants of iterated greedy algorithm in an ...Daha fazlası

Makale/Derleme 2020 Neural Computing and Application 4 Görüntülenme
Erişime Açık

Minimizing makespan wıth fuzzy processing times under job deterioration and learning effect

Oğuzhan Ahmet ARIK

This paper proposes a single machine/processor scheduling problem considering uncertain processing times under job deterioration and learning effect. In order to express uncertainty of parameters such as processing times, effects of deterioration and learning, fuzzy numbers are used. The objective function in this study is to minimize the makespan (maximum completion time) where the parameters of the problem are fully uncertain. In the literature, many single machine scheduling problems have been interested in deterministic model parameters such as processing times, due dates and release dates ...Daha fazlası

Makale/Derleme 2020 Journal of Industrial Engineering 6 Görüntülenme
Erişime Açık

Simple Assembly Line Balancing Problem of Type 1 with Grey Demand and Grey Task Durations

Oğuzhan Ahmet ARIK | Erkan KÖSE

Purpose – The purpose of this paper is to present a mixed integer programming model for simple assembly line balancing problems (SALBP) with Type 1 when the annual demand and task durations are uncertain and encoded with grey numbers. Design/methodology/approach – Grey theory and grey numbers are used for illustrating the uncertainty of parameters in an SALBP, where the objective is to minimize the total number of workstations. The paper proposes a 0-1 mathematical model for SALBP of Type 1 with grey demand and grey task durations. Findings – The uncertainty of the demand and task durations ar ...Daha fazlası

Makale/Derleme 2019 Grey Systems: Theory and Application 8 Görüntülenme
Erişime Açık

Crop pattern determination with mixed integer mathematical programming technique in specific agriculture land: a case study of Turkey

Oğuzhan Ahmet ARIK

Makale/Derleme

Makale/Derleme 2020 FRESENIUS ENVIRONMENTAL BULLETIN 3 Görüntülenme
Erişime Açık

Public transportation vehicle selection by the grey relational analysis method

Gülçin CANBULUT | Erkan KÖSE | Oğuzhan Ahmet ARIK

The success of businesses today is largely dependent on their ability to find solutions to complex problems they encounter. Vehicle selection, which requires considering many objective and subjective criteria, is at the top of these problems. The tramway selection problem of a company operating in the public transport sector in Turkey is discussed in this study. The company wants to increase passenger carrying capacity and renew its vehicle fleet. For this purpose, it has to choose from eight alternative vehicles with different superior features. Considering the high costs that may arise from ...Daha fazlası

Makale/Derleme 2021 Public Transportation 11 Görüntülenme
Erişime Açık

Genetic algorithm application for permutation flow shop scheduling problems

Oğuzhan Ahmet ARIK

In this paper, permutation flow shop scheduling problems (PFSS) are investigated with a genetic algorithm. PFSS problem is a special type of flow shop scheduling problem. In a PFSS problem, there are n jobs to be processed on m machines in series. Each job has to follow the same machine order and each machine must process jobs in the same job order. The most common performance criterion in the literature is the makespan for permutation scheduling problems. In this paper, a genetic algorithm is applied to minimize the makespan. Taillard’s instances including 20, 50, and 100 jobs with 5, 10, and ...Daha fazlası

Makale/Derleme 2022 Gazi University Journal of Science and Technology 7 Görüntülenme
Erişime Açık

A Genetic Algorithm Approach To Parallel Machine Scheduling Problems Under Effects Of Position-Dependent Learning And Linear Deterioration

Oğuzhan Ahmet ARIK

This paper investigates parallel machine scheduling problems where the objectives are to minimize total completion times under effects of learning and deterioration. The investigated problem is in NP-hard class and solution time for finding optimal solution is extremely high. The authors suggested a genetic algorithm, a well-known and strong metaheuristic algorithm, for the problem and we generated some test problems with learning and deterioration effects. The proposed genetic algorithm is compared with another existing metaheuristic for the problem. Experimental results show that the propose ...Daha fazlası

Makale/Derleme 2021 International Journal of Applied Metaheuristic Computing 7 Görüntülenme
Erişime Açık

Long-term plantation and harvesting planning for ındustrial plantation forest areas

Oğuzhan Ahmet ARIK

This paper integrates forest harvesting and plantation operations considering the industry’s long-term demand. Forest harvesting problem has been still one of the open problems in operational research, and the problem is interesting because forests are nonrenewable natural resources in short term. Each harvested tree must be replanted within a plantation plan in order to protect the ecosystem and future generation’s needs for forestry goods. A dynamic mixed integer programming approach is proposed for the problem. Furthermore, three hypothetical examples of diferent sizes are presented for the ...Daha fazlası

Makale/Derleme 2021 Operations Research Forum 3 Görüntülenme
Erişime Açık

An effective multi-population gwo based on reinforcement learning for multi-machine single-process flow shop scheduling problem

Oğuzhan Ahmet ARIK

This paper proposes the Flow Shop Scheduling Problem with Multi-machine Collaboration (FSSP-MC). In FSSP- MC, several machines can operate a single task simultaneously, so it is a coupling problem of resource composition and task sequencing, which is more difficult and has a larger scale solution space than the tradi- tional Flow Shop Scheduling Problem (FSSP), therefore an optimization algorithm with higher efficient and accurate is demanded. However, most existing intelligent algorithms are easily trapped into local optima and have low precision on solving large-scale problems. To this end, ...Daha fazlası

Hakemlik 2021 Soft Computing 4 Görüntülenme
Erişime Açık

Optimizing batch operations with batch-position-dependent learning effect and aging effect

Oğuzhan Ahmet ARIK

Motivated by applications in the metal pickling process, we study the optimization scheduling problems of batch operations with batch-position-dependent learning effect and aging effect. In production, a set of metal work- pieces are pickled on a fixed capacity single batch facility. If the pickling solution is regarded as the machine, the processing time of the metal work-pieces will be longer and increase in a power function because of the aging effect. At the same time, workers need to heat the solution. A worker can finish the task more and more quickly because of the learning effect, resu ...Daha fazlası

Hakemlik 2021 Computer And Industrial Engineering 2 Görüntülenme
6698 sayılı Kişisel Verilerin Korunması Kanunu kapsamında yükümlülüklerimiz ve çerez politikamız hakkında bilgi sahibi olmak için alttaki bağlantıyı kullanabilirsiniz.
Tamam
creativecommons
Bu site altında yer alan tüm kaynaklar Creative Commons Alıntı-GayriTicari-Türetilemez 4.0 Uluslararası Lisansı ile lisanslanmıştır.
Platforms