Journal: Annals of Operations Research

Found 3339 papers in total
A learning framework for neural networks using constrained optimization methods
2000,
Conventional supervised learing in neural networks is carried out by performing...
A discrete maintenance and replacement model under technological breakthrough expectations
2000,
Two cases of the discrete time finite horizon technology replacement problem are...
Scheduling a round robin tennis tournament under courts and players availability constraints
1999,
A practical problem encountered by the management of a tennis club is the organization...
Cardinality constrained bin-packing problems
1999,
We are concerned with a variant of the classical one-dimensional bin-packing problem....
The parallel search bench ZRAM and its applications
1999,
Distributed and parallel computation is, on the one hand, the cheapest way to increase...
A parallel branch-and-bound method for cluster analysis
1999,
Cluster analysis is a generic term coined for procedures that are used objectively to...
Scalable parallel computations for large-scale stochastic programming
1999,
Stochastic programming provides an effective framework for addressing decision...
A parallel computation approach for solving multistage stochastic network problems
1999,
This paper presents a parallel computation approach for the efficient solution of very...
Expected value of perfect information-based importance sampling solution procedures for multistage stochastic linear programs on parallel MIMD architectures
1999,
Multistage stochastic linear programming has many practical applications for problems...
Scheduling parallel tasks with sequential heads and tails
1999,
This paper considers scheduling of parallel tasks in a multiprogrammed, multiprocessor...
Sufficient conditions and sensitivity analysis for economic control problems
1999,
Second-order sufficient optimality conditions for nonlinear optimal control problems...
Almost sure optimality and optimality in probability for stochastic control problems over an infinite time horizon
1999,
A pathwise optimality criterion is proposed for stochastic control problems in order...
Fractal steady states in stochastic optimal control models
1999,
The paper is divided into two parts. We first extend the Boldrin and Montrucchio...
Control synthesis in grid schemes for Hamilton–Jacobi equations
1999,
Grid approximation schemes for constructing value functions and optimal feedbacks in...
Application of the impulsive control of piecewise deterministic processes to multi-item single machine stochastic scheduling
1999,
In this work, we study the optimization of a production system comprising a multi-item...
A linear programming approach to stability, optimisation and performance analysis for Markovian multiclass queueing networks
1999,
Our object of study is a multiclass queueing network which consists of a collection of...
Almost optimal policies for stochastic systems which almost satisfy conservation laws
1999,
When controlled stochastic systems have performances which satisfy generalised...
Heuristic algorithms for job-shop scheduling problems with stochastic precedence constraints
1999,
This paper deals with job-shop scheduling with stochastic precedence constraints given...
An algorithm for minimum wait draining of two-station fluid re-entrant line
1999,
In a fluid re-entrant line, fluid moves through a sequence of K buffers, partitioned...
Scheduling multi-operation jobs on a single machine
1999,
We consider the problem of scheduling n multi-operation jobs on a single machine. Each...
Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
1999,
This paper develops a branch and bound algorithm for solving the single-machine...
The setup polytope of N-sparse posets
1999,
The setup problem is the following single-machine scheduling problem: There are n jobs...
Recovering cyclic schedules from delay
1999,
A closed single-server system is considered in which n items are scheduled to...
A new lower bound for the open-shop problem
1999,
In this paper, we present a new lower bound for the open-shop problem. In shop...
Papers per page: