Detaylı Arama

İptal
Bulunan: 26 Adet 0.002 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: 26 Adet 0.002 sn
Tam Metin [2]
Açık Erişim Tarihi [1]
Dizin Platformu [3]
Doç. Dr. Oğuzhan Ahmet ARIKEndüstri Mühendisliği
Erişime Açık

Project staff scheduling with theory of coalition

Oğuzhan Ahmet ARIK | Erkan KÖSE

Project scheduling has been still one of the hottest topics in the management area. The goal of traditional project management is to complete the project at the earliest possible time in accordance with the available resources without violating priority relations of the activities involved. Unlike traditional project management, this study deals with the possibility of a coalition among the staf available to accomplish tasks of the project. The tasks can be fulflled by more than one staf members. Staf’s coalition shortens the completion time of the tasks. A natural problem that arises in this ...Daha fazlası

Erişime Açık

Mixed integer programming approach for seasonal anomalies in stock markets: A case study for BIST

Oğuzhan Ahmet ARIK

This paper proposes a mixed integer programming approach for seasonal anomalies in stock markets and presents a case study for the XU030 index in the stock market of Istanbul Stock Exchange (BIST). Stock markets are significant for economies of countries all over the world. Investors get economical wealth or lose some of their investment by selling and buying stocks. Therefore, buying and selling times of stocks are so important. This paper investigates a well-known effect called as ‘Sell in May and Go Away’ by proposing a MIP approach that searches best times for buying and selling of stocks ...Daha fazlası

Erişime Açık

Bulanık bozulma ve öğrenme etkileri altında tek makine erken/geç tamamlanma probleminin bulanık şans kısıtlı programlama tekniği ile incelenmesi

Oğuzhan Ahmet ARIK

Bu çalışmada tamamıyla bulanık ortamdaki tek makine çizelgeleme probleminde, öğrenme ve bozulma etkileri altındaki işlere ait ağırlıklı erken/geç tamamlanma maliyetlerinin en aza indirilmesi için bulanık karma tamsayılı doğrusal olmayan bir matematiksel model sunulmuştur. Çalışma içerisindeki işlem süreleri, öğrenme etkisi ve bozulma etkisi gibi parametreler belirsizlikleri nedeni ile bulanık sayılar olarak modellenmiştir. Öğrenme ve bozulma etkileri çizelgeleme problemlerinde yirmi yıldır oldukça ilgi görmektedirler. Erken/geç tamamlanma problemleri tam zamanında üretim felsefesini benimseyen ...Daha fazlası

Erişime Açık

Multi-objective fuzzy parallel machine scheduling problems under fuzzy job deterioration and learning effects

Oğuzhan Ahmet ARIK

This paper investigates a multi-objective parallel machine scheduling problem under fully fuzzy environment with fuzzy job deterioration effect, fuzzy learning effect and fuzzy processing times. Due dates are decision variables for the problem and objective functions are to minimise total tardiness penalty cost, to minimise earliness penalty cost and to minimise cost of setting due dates. Due date assignment problems are significant for Just-in-Time (JIT) thought. A JIT company may want to have optimum schedule by minimising cost combination of earliness, tardiness and setting due dates. In th ...Daha fazlası

Erişime Açık

Credibility based chance constrained programming for project scheduling with fuzzy activity durations

Oğuzhan Ahmet ARIK

This paper proposes a credibility based chance constrained programming approach for project scheduling problems with fuzzy activity durations where the objective is to minimize the fuzzy project completion time. This paper expresses the fuzzy events such as a project activity’s duration or project completion time with fuzzy chance constraints and the chance of a fuzzy event is illustrated with fuzzy credibility distribution. Due to uncertainty in durations of a project, fuzzy sets and fuzzy numbers can be used in order to illustrate the uncertainty and find a solution space for the problem. Th ...Daha fazlası

Erişime Açık

Genetic algorithm applied to the flow shop scheduling problem under effects of fuzzy learning and deterioration with a common fuzzy due date

Oğuzhan Ahmet ARIK

This research is to develop an approximate solution for a flow shop scheduling problem under the effects of fuzzy learning and deterioration with a common fuzzy due date by applying genetic algorithm technique. Real life is complex and filled with ambiguity and uncertainty. Due dates may not be always determined by a decision maker because of their biased approach and past experiences. Therefore, due dates may be defined in forms of any fuzzy set to encode decision maker’s biased approaches and satisfaction levels for completion times of jobs. The objective function of the problem in this rese ...Daha fazlası

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ı

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ı

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ı

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ı

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ı

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