Browsing WoS İndeksli Yayınlar Koleksiyonu by Title
Now showing items 21-40 of 1301
-
A Copula-Based BRDF Model
(WILEY, 2010)In this paper, we introduce a novel approach for modeling surface reflection. We focus on using a family of probability distributions called Archimedean copulas as BRDF models. The Archimedean representation has an attractive ... -
A critical evaluation of Heidegger's criticism of aesthetics in 'The Origin of the Work of Art'
(SAGE PUBLICATIONS LTD, 2017)This paper examines and critiques Heidegger's repudiation of aesthetics in his essay 'The Origin of the Work of Art' and claims that his alternative approach to artworks in the essay must be understood as a theory of ... -
A CRITICAL REVIEW ON CLASSIFICATION AND TERMINOLOGY OF SCISSOR STRUCTURES
(INT ASSOC SHELL & SPATIAL STRUCTURES-IASS, 2019)When the existing literature on the research of scissor structures is thoroughly investigated, it is seen that different researchers use different terminologies and classifications especially for the definition of the ... -
A DE Based Variable Iterated Greedy Algorithm for the No-Idle Permutation Flowshop Scheduling Problem with Total Flowtime Criterion
(SPRINGER-VERLAG BERLIN, 2012)In this paper, we present a variable iterated greedy (vIGP_DE) algorithm where its parameters (basically destruction size and cooling parameter for the simulated annealing type of acceptance criterion) are optimized by the ... -
A desktop application to learn the actual workload of the students
(ELSEVIER SCIENCE BV, 2009)The use of European Credit Transfer system (ECTS) provides a reference standard for exchange students across the European Union (EU). It helps more transparency and compatibility to compare the self-study period and ... -
A Differential Evolution Algorithm for the Economic Lot Scheduling Problem
(IEEE, 2011)In this study we provide a Differential Evolution (DE) based heuristic to solve the Economic Lot Scheduling Problem (ELSP) under basic period approach. The problem is to find the best cyclic production schedule of n items ... -
A Differential Evolution Algorithm for the Extraction of Complex Natural Resonance Frequencies of Electromagnetic Targets
(SPRINGER-VERLAG BERLIN, 2011)This paper presents a differential evolution algorithm in order to find unique resonance frequencies of an electromagnetic target in the resonance scattering region. These frequencies are estimated from the roots of Laplace ... -
A Differential Evolution Algorithm for the Median Cycle Problem
(IEEE, 2011)This paper extends the applications of differential evolution algorithms to the Median Cycle Problem. The median cycle problem is concerned with constructing a simple cycle composed of a subset of vertices of a mixed graph. ... -
A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion
(TAYLOR & FRANCIS LTD, 2011)In this paper, we investigate the use of a continuous algorithm for the no-idle permutation flowshop scheduling (NIPFS) problem with tardiness criterion. For this purpose, a differential evolution algorithm with variable ... -
A Differential Evolution Algorithm with a Variable Neighborhood Search for Constrained Function Optimization
(SPRINGER-VERLAG BERLIN, 2015)In this paper, a differential evolution algorithm based on a variable neighborhood search algorithm (DE_VNS) is proposed in order to solve the constrained real-parameter optimization problems. The performance of DE algorithm ... -
A Differential Evolution Algorithm with Variable Neighborhood Search for Multidimensional Knapsack Problem
(IEEE, 2015)This paper presents a differential evolution algorithm with a variable neighborhood search to solve the multidimensional knapsack problem. Unlike the studies employing check and repair operators, we employ some sophisticated ... -
A disassembly line balancing problem with fixed number of workstations
(ELSEVIER, 2016)In this study, a Disassembly Line Balancing Problem with a fixed number of workstations is considered. The product to be disassembled comprises various components, which are referred to as its parts. There is a specified ... -
A Discrete Artificial Bee Colony Algorithm for the Assignment and Parallel Machine Scheduling Problem in DYO Paint Company
(IEEE, 2014)This paper presents a discrete artificial bee colony algorithm to solve the assignment and parallel machine scheduling problem in DYO paint company. The aim of this paper is to develop some algorithms to be employed in the ... -
A Discrete Artificial Bee Colony Algorithm For the Economic Lot Scheduling Problem
(IEEE, 2011)In this study we present a discrete artificial bee colony (DABC) algorithm to solve the economic lot scheduling problem (ELSP) under extended basic period (EBP) approach and power-of-two (PoT) policy. In specific, our ... -
A Discrete Artificial Bee Colony Algorithm for the Economic Lot Scheduling Problem with Returns
(IEEE, 2014)In this study, we model the Economic Lot Scheduling problem with returns (ELSPR) under the basic period (BP) policy with power-of-two (PoT) multipliers, and solve it with a discrete artificial bee colony (DABC) algorithm. ... -
A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem
(ELSEVIER SCIENCE INC, 2011)In this paper, a discrete artificial bee colony (DABC) algorithm is proposed to solve the lot-streaming flow shop scheduling problem with the criterion of total weighted earliness and tardiness penalties under both the ... -
A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities
(ELSEVIER SCIENCE INC, 2014)This paper presents a novel discrete artificial bee colony (DABC) algorithm for solving the multi-objective flexible job shop scheduling problem with maintenance activities. Performance criteria considered are the maximum ... -
A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
(ELSEVIER SCIENCE INC, 2013)In this paper, we present a discrete artificial bee colony algorithm to solve the no-idle permutation flowshop scheduling problem with the total tardiness criterion. The no-idle permutation flowshop problem is a variant ... -
A Discrete Artificial Bee Colony Algorithm for the Permutation Flow Shop Scheduling Problem with Total Flowtime Criterion
(IEEE, 2010)Very recently, Jarboui et al. [1] (Computers & Operations Research 36 (2009) 2638-2646) and Tseng and Lin [2] (European Journal of Operational Research 198 (2009) 84-92) presented a novel estimation distribution algorithm ... -
A Discrete Artificial Bee Colony Algorithm for the Permutation Flowshop Scheduling Problem with Sequence-Dependent Setup Times
(IEEE, 2016)A discrete artificial bee colony ( DABC) algorithm for the permutation flowshop scheduling problem with sequence-dependent setup times (PFSP-SDST) is presented in this paper. PFSP-SDST is an important problem that has ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
