In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable is associated to a subset of independent activities (antichains). The properties of the model are first investigated. In particular, conditions are given that allow a solution of the linear program to be a feasible sched...

The Variable Neighbourhood Search (VNS) is a recent metaheuristic for solving optimization problems whose basic idea is systematic change of neighborhood within a local search. In this paper we present basic rules of the VNS and its extensions. We briefly summarize the most relevant applications in Artificial Intelligence. These applications comprise classic tasks, like constraints satisfaction...

We present a large neighbourhood search method for solving the frequency assignment problem with multiple source interferences. Starting from an initial solution, subproblems of auto-adjustable size are iteratively generated and solved with either a greedy algorithm or an exact method. The approach has been successfully tested on realistic instances issued from military applications.

Course Scheduling consists of assigning lecture events to a limited set of specific timeslots and rooms. The objective is to satisfy as many soft constraints as possible, while maintaining a feasible solution timetable. The most successful techniques to date require a compute-intensive examination of the solution neighbourhood to direct searches to an optimum solution. Although they may require...

In this paper, we investigate the effectiveness of combining the key components of the basic metaheuristic methods on the quality of solutions produced for Uncapacitated Examination Timetabling Problem (UETP). These components are recombination, randomness, and neighbourhood structures. The Harmony search Algorithm (HSA) is used to simulate different combinations of these components. It has thr...

The time complexity of a search depends on (1) the size of the neighbourhood and (2) the complexity in determining the cost of the moves. Therefore in order for the search to be effective and efficient, the neighbourhood must be highly constrained and it needs to be evaluated quickly, however without losing the ability to provide access to improved solutions. This paper investigates strategies ...

Job Shop Scheduling Problem (JSSP) is an optimization problem in which ideal jobs are assigned to resources at particular times. In recent years many attempts have been made at the solution of JSSP using a various range of tools and techniques such as Branch and Bound and Heuristics algorithms. This paper proposed a new algorithm based on Genetic Algorithm (GA), Tabu Search (TS) and Simulated A...

A piano fingering indicates which finger should play each note in a piece. Such a guideline is very helpful for both amateur and experienced players in order to play a piece fluently. In this paper, we propose a variable neighborhood search algorithm to generate piano fingerings for complex polyphonic music, a frequently encountered case that was ignored in previous research. The algorithm take...

The order batching problem is a part of the picking process of items in a warehouse. A set of items conform an order and a set of orders conform a batch. The problem consist of grouping the orders received in the warehouse in different batches. Each batch have to be collected by a single picker without exceed a capacity limit. The objective is to minimize the total time needed to collect all th...