Scheduling trajectories on a planar surface with moving obstacles.
Scheduling UET trees with communication delays on two processors
Scheduling UET Trees with Communication Delays on two Processors
In this paper, we present a new linear time algorithm for scheduling UECT (Unit Execution and Communication Time) trees on two identical processors. The chosen criterion is the makespan. The used strategy is based on clustering of tasks. We show that this algorithm builds optimal schedules. Some extensions are discussed for non UECT tasks.
Scheduling under the Due Date Criterion with Varying Penalties for Lateness
Scheduling with periodic availability constraints and irregular cost functions
This paper addresses a one-machine scheduling problem in which the efficiency of the machine is not constant, that is the duration of a task is longer in badly efficient time periods. Each task has an irregular completion cost. Under the assumption that the efficiency constraints are time-periodic, we show that the special case where the sequence is fixed can be solved in polynomial time. The general case is NP-complete so that we propose a two-phase heuristic to find good solutions. Our approach...
Schwach verkoppelte Ungleichungssysteme und konvexe Spline-Interpolation.
Schwankungsbereiche linearer Optimierungsaufgaben.
Scope and generalization of the theory of linearly constrained linear regulator
A previous paper by the same authors presented a general theory solving (finite horizon) feasibility and optimization problems for linear dynamic discrete-time systems with polyhedral constraints. We derived necessary and sufficient conditions for the existence of solutions without assuming any restrictive hypothesis. For the solvable cases we also provided the inequative feedback dynamic system, that generates by forward recursion all and nothing but the feasible (or optimal, according to the cases)...
SDP approach for solving LQ control problem subject to implicit system.
Search Game on an Odd Number of Arcs with Immobile Hider
Search Game on the Union of N Identical Graphs Joined at One or Two Points
Second order converse duality for nonlinear programming.
Second order convexity and a modified objective function method in mathematical programming
Second order optimality conditions for differentiable multiobjective problems
Second order optimality conditions for differentiable multiobjective problems
A second order optimality condition for multiobjective optimization with a set constraint is developed; this condition is expressed as the impossibility of nonhomogeneous linear systems. When the constraint is given in terms of inequalities and equalities, it can be turned into a John type multipliers rule, using a nonhomogeneous Motzkin Theorem of the Alternative. Adding weak second order regularity assumptions, Karush, Kuhn-Tucker type conditions are therefore deduced.
Second Order optimality in Markov decision chains
The article is devoted to Markov reward chains in discrete-time setting with finite state spaces. Unfortunately, the usual optimization criteria examined in the literature on Markov decision chains, such as a total discounted, total reward up to reaching some specific state (called the first passage models) or mean (average) reward optimality, may be quite insufficient to characterize the problem from the point of a decision maker. To this end it seems that it may be preferable if not necessary...
Second-order contingent derivative of the perturbation map in multiobjective optimization.
Second-order differential proximal methods for equilibrium problems.
Second-order optimality conditions for nondominated solutions of multiobjective programming with data
We examine new second-order necessary conditions and sufficient conditions which characterize nondominated solutions of a generalized constrained multiobjective programming problem. The vector-valued criterion function as well as constraint functions are supposed to be from the class . Second-order optimality conditions for local Pareto solutions are derived as a special case.
Second-order sufficient condition for -stable functions
The aim of our article is to present a proof of the existence of local minimizer in the classical optimality problem without constraints under weaker assumptions in comparisons with common statements of the result. In addition we will provide rather elementary and self-contained proof of that result.