All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 2

Displaying 21 – 39 of 39

Showing per page

Multicriteria scheduling problems: a survey

V. T'kindt, J.-C. Billaut (2010)

RAIRO - Operations Research

This paper presents a state-of-the-art survey on multicriteria scheduling and introduces a definition of a multicriteria scheduling problem. It provides a framework that allows to tackle multicriteria scheduling problems, according to Decision Aid concepts. This problem is decomposed into three different problems. The first problem is about obtaining a model. The second one is how to take criteria into account and the third one is about solving a scheduling problem. An extension to an existing...

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...

New trends in design of observers for time-delay systems

Olivier Sename (2001)

Kybernetika

This paper presents some recent results about the design of observers for time-delay systems. It is focused on methods that can lead to design some useful observers in practical situations. First the links between observability properties and observers design is emphasized. Then some necessary and sufficient conditions and a method are provided to obtain unknown input observers for time-delay systems. Furthermore some H ∞ design using Lyapunov–Krasovskii and Lyapunov–Razumikhin theories are presented...

"On the Shoulders of Giants" A brief excursion into the history of mathematical programming

Rainer Tichatschke (2012)

Discussiones Mathematicae, Differential Inclusions, Control and Optimization

Similar to many mathematical fields also the topic of mathematical programming has its origin in applied problems. But, in contrast to other branches of mathematics, we don't have to dig too deeply into the past centuries to find their roots. The historical tree of mathematical programming, starting from its conceptual roots to its present shape, is remarkably short, and to quote Isaak Newton, we can say: "We are standing on the shoulders of giants". The goal of...

Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution

Anass Nagih, Gérard Plateau (2010)

RAIRO - Operations Research

Fractional programming consists in optimizing a ratio of two functions subject to some constraints. Different versions of this model, linear or nonlinear, have applications in various fields like combinatorial optimization, stochastic programming, data bases, and economy. Three resolution methods are presented: direct solution, parametric approach and solution of an equivalent problem.

Time–dependent Simple Temporal Networks: Properties and Algorithms

Cédric Pralet, Gérard Verfaillie (2013)

RAIRO - Operations Research - Recherche Opérationnelle

Simple Temporal Networks (STN) allow conjunctions of minimum and maximum distance constraints between pairs of temporal positions to be represented. This paper introduces an extension of STN called Time–dependent STN (TSTN), which covers temporal constraints for which the minimum and maximum distances required between two temporal positions x and y are not necessarily constant but may depend on the assignments of x and y. Such constraints are useful to model problems in which the duration of an...

Currently displaying 21 – 39 of 39

Previous Page 2