Optimal scheduling of the -machine assembly-type flow shop
Optimal scheduling of the 3-machine assembly-type flow shop
We address the 3-Machine Assembly-Type Flowshop Scheduling Problem (3MAF). This problem is known to be NP-complete in the strong sense. We propose an exact branch and bound method based on a recursive enumeration of potential inputs and outputs of the machines. Using this algorithm, several large size instances have been solved to optimality.
Optimal sequencing of capacity expansion projects under uncertainty
Optimal Short-Term Operation Planning of Interconnected Hydro-Terminal Power Systems
Optimal simultaneous replacement and maintenance of a machine with process discontinuities
Optimal snapshot location for computing POD basis functions
The construction of reduced order models for dynamical systems using proper orthogonal decomposition (POD) is based on the information contained in so-called snapshots. These provide the spatial distribution of the dynamical system at discrete time instances. This work is devoted to optimizing the choice of these time instances in such a manner that the error between the POD-solution and the trajectory of the dynamical system is minimized. First and second order optimality systems are given. Numerical...
Optimal solutions of multivariate coupling problems
Some necessary and some sufficient conditions are established for the explicit construction and characterization of optimal solutions of multivariate transportation (coupling) problems. The proofs are based on ideas from duality theory and nonconvex optimization theory. Applications are given to multivariate optimal coupling problems w.r.t. minimal -type metrics, where fairly explicit and complete characterizations of optimal transportation plans (couplings) are obtained. The results are of interest...
Optimal starting times for a class of single machine scheduling problems with earliness and tardiness penalties
Optimal stationary policies inrisk-sensitive dynamic programs with finite state spaceand nonnegative rewards
This work concerns controlled Markov chains with finite state space and nonnegative rewards; it is assumed that the controller has a constant risk-sensitivity, and that the performance ofa control policy is measured by a risk-sensitive expected total-reward criterion. The existence of optimal stationary policies isstudied within this context, and the main resultestablishes the optimalityof a stationary policy achieving the supremum in the correspondingoptimality equation, whenever the associated...
Optimal stopping of a sequence of maxima over an unobservable sequence of maxima
Optimal systematic withdrawal strategies
Optimal tool partitioning rules for numerically controlled punch press operations
Optimal tour planning with specified nodes
Optimal traffic assignment in a SS/TDMA frame : a new approach by set covering and column generation
Optimal transfer-ordering strategy for a deteriorating inventory in declining market.
Optimal transportation networks as free Dirichlet regions for the Monge-Kantorovich problem
In the paper the problem of constructing an optimal urban transportation network in a city with given densities of population and of workplaces is studied. The network is modeled by a closed connected set of assigned length, while the optimality condition consists in minimizing the Monge-Kantorovich functional representing the total transportation cost. The cost of trasporting a unit mass between two points is assumed to be proportional to the distance between them when the transportation is carried...
Optimal uncertainty quantification for legacy data observations of Lipschitz functions
We consider the problem of providing optimal uncertainty quantification (UQ) – and hence rigorous certification – for partially-observed functions. We present a UQ framework within which the observations may be small or large in number, and need not carry information about the probability distribution of the system in operation. The UQ objectives are posed as optimization problems, the solutions of which are optimal bounds on the quantities of interest; we consider two typical settings, namely parameter...
Optimale Aufteilung des Stichprobenumfangs bei mehreren Merkmalen.
Optimality and Duality for a Class of Nondifferentiable Minimax Fractional Programming Problems
Optimality and duality in nonsmooth multiobjective optimization involving V-type I invex functions.