The main purpose of optimized sequencing of landing/taking-o® operations is to obtain a better exploitation of the existing airport infrastructure, thus improving the performances of the entire ATC system. In this paper we deal with innovative sequencing models for managing arrivals and departures times of the aircrafts at an airport. These models are based on the so-called alternative graph fo...

We propose an associative mechanism for adaptive generation of problems in intelligent tutors. Our evaluations of the tutors that use associative adaptation for problem sequencing show that 1) associative adaptation targets concepts less well understood by students; and 2) associative adaptation helps students learn with fewer practice problems. Apart from being domainindependent, the advantage...

In many industrial robotics applications, such as spot-welding, spray-painting or drilling, the robot is required to visit successively multiple targets. The robot travel time among the targets is a significant component of the overall execution time. This travel time is in turn greatly affected by the order of visit of the targets, and by the robot configurations used to reach each target. The...

In a previous paper, a simple genetic algorithm (GA) was developed for finding (approximately) the minimum makespan of the n-job, m-machine permutation flowshop sequencing problem (PFSP). The performance of the algorithm was comparable to that of a naive neighborhood search technique and a proven simulated annealing algorithm. However, recent results have demonstrated the superiority of a tabu ...

We give a short proof of a result of Tovey [Non-approximability of precedence-constrained sequencing to minimize setups, DiscreteAppl. Math. 134:351–360, 2004] on the inapproximability of a scheduling problem known as precedence-constrained class sequencing. In addition, we present an approximation algorithm with performance guarantee (c + 1)/2, where c is the number of colors. This improves up...

Variable Neighborhood Search (VNS) is a relatively new metaheuristic for solving hard combinatorial optimisation problems. One such optimisation problem is the Car Sequencing Problem (CarSP), where a sequence of cars along the assembly line with minimum production costs has to be found. Although VNS is a successful metaheuristic, it takes a long time until a suitable solution is found for real-...

background and objectives: annexin is the common name for genes and proteins that were identified as calcium-dependent phospholipid-binding proteins. recently a more complex set of functions has been recognized for this superfamily of proteins including in vesicle trafficking, cell division, apoptosis, calcium signalling, mineralization, crystal nucleation inside the extracellular organelles-ma...

background: previous studies have shown that leukemogenic chromosomal translocations, including fusions between break point cluster region (bcr) and abelson (abl) are present in the peripheral blood of healthy individuals. the aim of this study was to gain insights into the genetic alterations other than bcr-abl translocation in molecular level, which cause chronic myeloid leukemia (cml). metho...