Stochastic two-sided U-type assembly line balancing: a genetic algorithm approach

In this paper, a novel stochastic two-sided U-type assembly line balancing (STUALB) procedure, an algorithm based on the genetic algorithm and a heuristic priority rule-based procedure to solve STUALB problem are proposed. With this new proposed assembly line design, all advantages of both two-sided assembly lines and U-type assembly lines are combined. Due to the variability of the real-life conditions, stochastic task times are also considered in the study. The proposed approach aims to minimise the number of positions (i.e. the U-type assembly line length) as the primary objective and to minimise the number of stations (i.e. the number of operators) as a secondary objective for a given cycle time. An example problem is solved to illustrate the proposed approach. In order to evaluate the efficiency of the proposed algorithm, test problems taken from the literature are used. The experimental results show that the proposed approach performs well.     

Coping with production time variability via dynamic lead-time quotation

In this paper, we propose two dynamic lead-time quotation policies in an M/GI/1 type make-to-stock queueing system serving lead-time sensitive customers with a single type of product. Incorporating non-exponential service times in an exact method for make-to-stock queues is usually deemed difficult. Our analysis of the proposed policies is exact and requires the numerical inversion of the Laplace transform of the sojourn time of an order to be placed. The first policy assures that the long-run probability of delivering the product within the quoted lead-time is the same for all backlogged customers. The second policy is a refinement of the first which improves the profitability if customers are oversensitive to even short delays in delivery. Numerical results show that both policies perform close to the optimal policy that was characterized only for exponential service times. The new insight gained is that the worsening impact of the production time variability, which is felt significantly in systems accepting all customers by quoting zero lead times, decreases when dynamic lead-time quotation policies are employed.     

Estimating Construction Material Indices with ARIMA and Optimized NARNETs

Construction Industry operates relying on various key economic indicators. One of these indicators is material prices. On the other hand, cost is a key concern in all operations of the construction industry. In the uncertain conditions, reliable cost forecasts become an important source of information. Material cost is one of the key components of the overall cost of construction. In addition, cost overrun is a common problem in the construction industry, where nine out of ten construction projects face cost overrun. In order to carry out a successful cost management strategy and prevent cost overruns, it is very important to find reliable methods for the estimation of construction material prices. Material prices have a time dependent nature. In order to increase the foreseeability of the costs of construction materials, this study focuses on estimation of construction material indices through time series analysis. Two different types of analysis are implemented for estimation of the future values of construction material indices. The first method implemented was Autoregressive Integrated Moving Average (ARIMA), which is known to be successful in estimation of time series having a linear nature. The second method implemented was Non-Linear Autoregressive Neural Network (NARNET) which is known to be successful in modeling and estimating of series with non-linear components. The results have shown that depending on the nature of the series, both these methods can successfully and accurately estimate the future values of the indices. In addition, we found out that Optimal NARNET architectures which provide better accuracy in estimation of the series can be identified/discovered as result of grid search on NARNET hyperparameters.     

Preserving spatial information and overcoming variations in appearance for face recognition

Local feature-based approaches mainly aim to achieve robustness to variations in facial images by assuming that only some parts of the facial images may be affected. However, such approaches may lose spatial information. In this study, a compromise feature extraction scheme is studied which extracts local features while preserving spatial information. The proposed scheme exploits an ensemble of classifiers where each member is constructed using randomly selected design parameters including the size, number and location of sub-images for local feature extraction. Experiments conducted on FERET and ORL databases have shown that proposed scheme surpasses the local feature-based reference systems which focus on either local information or preserving spatial information.     

Approximation by Stancu–Chlodowsky polynomials

In this paper, we investigate convergence and approximation properties of a Chlodowsky type generalization of Stancu polynomials (we called Stancu–Chlodowsky polynomials).The rates of convergence of this generalization are obtained by means of modulus of continuity and by using the $K$-functional of Peetre. We also present and prove theorems on weighted approximation and the order of approximation of continuous functions by these operators on all positive semi-axis.     

Schauder bases and approximation property in fuzzy normed spaces

Our aim in this article is to introduce and study the notion of weak and strong Schauder bases in fuzzy normed spaces. Further, we introduce strong and weak fuzzy approximation properties and set a relationship between these two new notions which may provide an acceleration to the structural analysis of fuzzy normed spaces.     

A new perspective on data homogeneity in software cost estimation: a study in the embedded systems domain

Cost estimation and effort allocation are the key challenges for successful project planning and management in software development. Therefore, both industry and the research community have been working on various models and techniques to accurately predict the cost of projects. Recently, researchers have started debating whether the prediction performance depends on the structure of data rather than the models used. In this article, we focus on a new aspect of data homogeneity, “cross- versus within-application domain”, and investigate what kind of training data should be used for software cost estimation in the embedded systems domain. In addition, we try to find out the effect of training dataset size on the prediction performance. Based on our empirical results, we conclude that it is better to use cross-domain data for embedded software cost estimation and the optimum training data size depends on the method used.