Detaylı Arama

İptal
Bulunan: 7 Adet 0.006 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
Erişime Açık

The effect of five different universal adhesives on the clinical success of class I restorations: 24-month clinical follow-up.

Nazire Nurdan ÇAKIR

Objectives The aim of this study was to evaluate the 24-month clinical performance of universal adhesives on the restoration success of Class I carious lesions. Materials and methods Five different universal adhesives (Gluma Bond Universal (GU), Clearfil Universal (CU), Prime&Bond Elect Universal (PU), All bond Universal (AU), and Single Bond Universal (SU)) were used in the self-etch and etch-and-rinse modes in 42 patients. The study was conducted with 10 groups, with 20 restorations in each group. The restorations were evaluated at baseline and during a 24-month recall using World Dental Fed ...Daha fazlası

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ı

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ı

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ı

Erişime Açık

Additive manufacturing scheduling problem considering assembly operations of parts

Oğuzhan Ahmet ARIK

Additive manufacturing (AM) is a candidate to be one of the future general-purpose technologies. AM is called with 3D printing, Rapid Prototyping, Direct Digital Manufacturing, layered manufacturing, and/or additive manufacturing. Today, AM is a tool for producing customized small products with small lot sizes. Tomorrow, it will be possible for AM to enter every home and to be used for general purposes. The literature about AM has focused mainly on the technology to decrease the cost of AM, to increase the speed of AM machines, and to increase the common availability of those machines. There a ...Daha fazlası

Erişime Açık

Population-based tabu search with evolutionary strategies for permutation flow shop scheduling problems under effects of position-dependent learning and linear deterioration

Oğuzhan Ahmet ARIK

This paper investigates permutation flow shop scheduling (PFSS) problems under the effects of position-dependent learning and linear deterioration. In a PFSS problem, there are n jobs and m machines in series. Jobs are separated into operations on m different machines in series, and jobs have to follow the same machine order with the same sequence. The PFSS problem under the effects of learning and deterioration is introduced with a mixed-integer nonlinear programming model. The time requirement for solving large-scale problems type of PFSS problem is exceedingly high. Therefore, wellknown met ...Daha fazlası

Erişime Açık

Artificial Bee Colony Algorithm Including Some Components Of Iterated 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ı

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