Browsing WoS İndeksli Yayınlar Koleksiyonu by Title
Now showing items 41-60 of 1481
-
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 ... -
A Discrete Artificial Bee Colony Algorithm for the Team Orienteering Problem with Time Windows
(IEEE, 2013)This paper presents a discrete artificial bee colony algorithm (DABC) for solving the team orienteering problem with time windows (TOPTW). The proposed algorithm employs a destruction and construction procedure to generate ... -
A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops
(ELSEVIER SCIENCE INC, 2011)Obtaining an optimal solution for a permutation flowshop scheduling problem with the total flowtime criterion in a reasonable computational timeframe using traditional approaches and optimization tools has been a challenge. ... -
A Discrete Artificial Bee Colony Algorithm for the Traveling Salesman Problem with Time Windows
(IEEE, 2012)This paper presents a discrete artificial bee colony algorithm (DABC) for solving the traveling salesman problem with time windows (TSPTW) in order to minimize the total travel cost of a given tour. TSPTW is a difficult ... -
A discrete cross aisle design model for order-picking warehouses
(ELSEVIER SCIENCE BV, 2019)In this paper, we develop new warehouse designs that provide a reduction in travel distance for the order-picking operation, which is the most costly operation and the one most closely associated with order delivery time. ... -
A Discrete Harmony Search Algorithm for the Economic Lot Scheduling Problem with Power of Two Policy
(IEEE, 2012)In this paper, we present a problem specific discrete harmony search (DHS) algorithms to solve the economic lot scheduling problem (ELSP) under the extended basic period (EBP) approach and power-of-two (PoT) policy. In ... -
A Discussion of Financial Regulations' Impact on the Subprime Crisis: Implications for Financial Markets
(PREMIER PUBLISHING, INC, 2010)The financial crisis sparked by the US subprime is now posing a serious threat to global financial markets, with its severity intensifying as widening losses and a liquidity crunch push some financial institutions to the ... -
A Dual Circularly Polarized Omnidirectional Receiver Antenna for Satellite Communication
(IEEE, 2017)This study describes about an omnidirectional antenna for satellite communication applications possessing dual circular polarization at almost over the full azimuth plane and wide elevation plane. The antenna does not use ... -
A Dynamic Berth Allocation Problem with Priority Considerations under Stochastic Nature
(SPRINGER-VERLAG BERLIN, 2012)Stochastic nature of vessel arrivals and handling times adds to the complexity of the well-known NP-hard berth allocation problem. To aid real decision-making under customer differentiations, a dynamic stochastic model ... -
A dynamic connectedness analysis between rare earth prices and renewable energy
(2023)Current world environmental challenges put pressure on clean energy produced mostly through renewables. There is an undeniably important role of rare earth minerals in renewable energy technologies. This study aims to infer ... -
A Feature Selection Application Using Particle Swarm Optimization for Learning Concept Detection
(SPRINGER-VERLAG BERLIN, 2017)Recent developments of computational intelligence on educational technology yield concept map mining as a new research area. Concept map mining covers the extraction of learning concepts, specifying relations among them, ... -
A fixed point theorem on soft G-metric spaces
(INT SCIENTIFIC RESEARCH PUBLICATIONS, 2016)We introduce soft G-metric spaces via soft element. Then, we obtain soft convergence and soft continuity by using soft G-metric. Also, we prove a fixed point theorem for mappings satisfying sufficient conditions in soft ... -
A Framework Model for Data Reliability in Wireless Sensor Networks
(IEEE, 2016)In this study a model for data reliability in wireless sensor networks is proposed, in which machine learning methods are used. Proposed framework includes data modelling, missing data prediction, anomaly detection, data ... -
A General BRDF Representation Based on Tensor Decomposition
(WILEY, 2011)Generating photo-realistic images through Monte Carlo rendering requires efficient representation of lightsurface interaction and techniques for importance sampling. Various models with good representation abilities have ... -
A General Variable Neighborhood Search Algorithm for the No-Idle Permutation Flowshop Scheduling Problem
(SPRINGER-VERLAG BERLIN, 2013)In this study, a general variable neighborhood search (GVNS) is presented to solve no-idle permutation flowshop scheduling problem (NIPFS), where idle times are not allowed on machines. GVNS is a metaheuristic, where inner ... -
A General Variable Neighborhood Search for the No-Idle Flowshop Scheduling Problem with Makespan Criterion
(IEEE, 2019)This paper proposes a novel general variable neighborhood search (GVNS) algorithm to solve the no-idle flowshop scheduling problem with the makespan criterion. The initial solution of the GVNS is generated using the FRB5 ... -
A Genetic Algorithm for the Economic Lot Scheduling Problem under Extended Basic Period Approach and Power-of-Two Policy
(SPRINGER-VERLAG BERLIN, 2012)In this study, we propose a genetic algorithm (GA) for the economic lot scheduling problem (ELSP) under extended basic period (EBP) approach and power-of-two (PoT) policy. The proposed GA employs a multi-chromosome solution ...