Time-series forecasting is an important research and application area. Much effort has been
devoted over the past several decades to develop and improve the time-series forecasting …

Simulated Annealing (SA), Tabu Search (TS), Genetic Algorithm (GA), and Ant Colony
System (ACS) are four of the main algorithms for solving challenging problems of intelligent …

The redundancy allocation problem (RAP) is a well known NP-hard problem which involves
the selection of elements and redundancy levels to maximize system reliability given various …

In this article, we describe a new local search approach for solving the buffer allocation
problem in unreliable production lines. In this problem, we need to determine near optimal …

Abstract SA, TS, GA and ACS are four of the main algorithms for solving challenging
problems of intelligent systems. In this paper we consider Examination Timetabling Problem …

The most common approach to multiobjective examination timetabling is the weighted sum
aggregation of all criteria into one cost function and application of some single-objective …

The advances on DNA microarray technologies have enabled researchers to gain hundreds
to thousands of gene expression levels. Much effect has been devoted over the past decade …

This article uses a hybrid optimization approach to solve the discrete facility layout problem
(FLP), modelled as a quadratic assignment problem (QAP). The idea of this approach …

The buffer allocation problem (BAP) is one of the major optimisation problems faced by
production system designers. BAP is widely studied in the literature since buffers have a …

Scheduling can be thought of as a decision making process which involves the allocation of
limited resources to tasks over time. The resources may be machines, people or other …