EuDML | Browse

Page 1

Displaying 1 – 5 of 5

New algorithms for coupled tasks scheduling – a survey

Jacek Blazewicz, Grzegorz Pawlak, Michal Tanas, Wojciech Wojciechowicz (2012)

RAIRO - Operations Research - Recherche Opérationnelle

The coupled tasks scheduling problem is a class of scheduling problems introduced for beam steering software of sophisticated radar devices, called phased arrays. Due to increasing popularity of such radars, the importance of coupled tasks scheduling is constantly growing. Unfortunately, most of the coupled tasks problems are NP-hard, and only a few practically usable algorithms for such problems were found. This paper provides a survey of already known complexity results of various variants of...

Niching mechanisms in evolutionary computations

Zdzisław Kowalczuk, Tomasz Białaszewski (2006)

International Journal of Applied Mathematics and Computer Science

Different types of niching can be used in genetic algorithms (GAs) or evolutionary computations (ECs) to sustain the diversity of the sought optimal solutions and to increase the effectiveness of evolutionary multi-objective optimization solvers. In this paper four schemes of niching are proposed, which are also considered in two versions with respect to the method of invoking: a continuous realization and a periodic one. The characteristics of these mechanisms are discussed, while as their performance...

Non orthogonal cutting problem the case of trapezoidal pieces.

Ouafi, Rachid, Khelladi, Abdelkader (2009)

International Journal of Open Problems in Computer Science and Mathematics. IJOPCM

Nonlinear nonconvex optimization by evolutionary algorithms applied to robust control.

Cervera, Joaquín, Baños, Alfonso (2009)

Mathematical Problems in Engineering

Non-parametric approximation of non-anticipativity constraints in scenario-based multistage stochastic programming

Jean-Sébastien Roy, Arnaud Lenoir (2008)

Kybernetika

We propose two methods to solve multistage stochastic programs when only a (large) finite set of scenarios is available. The usual scenario tree construction to represent non-anticipativity constraints is replaced by alternative discretization schemes coming from non-parametric estimation ideas. In the first method, a penalty term is added to the objective so as to enforce the closeness between decision variables and the Nadaraya–Watson estimation of their conditional expectation. A numerical application...