On operators and search space topology in multi-objective flow shop scheduling

Multi-objective optimization using evolutionary algorithms identifies Pareto-optimal alternatives or their close approximation by means of a sequence of successive local improvement moves. While several successful applications to combinatorial optimization problems are known, studies of underlying problem structures are still scarce.     

Differential effects of synchronous and asynchronous multifinger coactivation on human tactile performance

Background  

Repeated execution of a tactile task enhances task performance. In the present study we sought to improve tactile performance with unattended activation-based learning processes (i.e., focused stimulation of dermal receptors evoking neural coactivation (CA)). Previous studies show that the application of CA to a single finger reduced the stationary two-point discrimination threshold and significantly increased tactile acuity. These changes were accompanied by an expansion of the cortical finger representation in primary somatosensory cortex (SI). Here we investigated the effect of different types of multifinger CA on the tactile performance of each finger of the right hand.     

Towards a normative model for inventory cost management in a generalized ABC classification system

This paper establishes a general ABC inventory classification system as the foundation for a normative model of the maintenance cost structure and stock turnover characteristics of a large, multi-item inventory system with constant demand. For any specified number of inventory classes, the model allows expression of the overall system combined ordering and holding cost in terms of (i) the re-ordering frequencies for the items in each inventory class and (ii) the inventory class structure, that is, the proportion of the total system's items that are in each inventory class. The model yields a minimum total maintenance cost function, which reflects the effect of class structure on inventory maintenance costs and turnover. If the Pareto curve (a.k.a. Distribution-by-value function) for the inventory system can be expressed (or approximated) analytically, the model can also be used to determine an optimal class structure, as well as an appropriate number of inventory classes. A special case of the model produces a simply structured, class-based ordering policy for minimizing total inventory maintenance costs. Using real data, the cost characteristics of this policy are compared to those of a heuristic, commonly used by managers of multi-item inventory systems. This cost comparison, expressed graphically, underscores the need for normative modelling approaches to the problem of inventory cost management in large, multi-item systems.     

Some remarks on general commutators theorems

The paper proves some general facts on commutators that refer to Fuglede-Putnam classical theorem in the spectral theory of not necessarily selfadjoint operators.     

A version of Hörmander’s theorem for the fractional Brownian motion

It is shown that the law of an SDE driven by fractional Brownian motion with Hurst parameter greater than 1/2 has a smooth density with respect to Lebesgue measure, provided that the driving vector fields satisfy Hörmander’s condition. The main new ingredient of the proof is an extension of Norris’ lemma to this situation.     

P-harmonic obstacle problems

We prove an extension theorem for Sobolev functions which plays an important role in the partial regularity theory of vector valued functions which minimize degenerate variational integrals subject to some nonlinear side conditions in the image space.     

Approximating the single source unsplittable min-cost flow problem

In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing. Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques do not seem to be capable of providing solutions without also violating the cost constraint. We give the first approximation results with hard cost constraints. Moreover, all our results dominate the best known bicriteria approximations. Finally, we provide results on the hardness of approximation for several variants of the problem. Received: August 23, 2000 / Accepted: April 20, 2001?Published online October 2, 2001