The Dirichlet Problem for Curvature Equations in Riemannian Manifolds

We prove the existence of classical solutions to the Dirichlet problem for a class of fully nonlinear elliptic equations of curvature type on Riemannian manifolds. We also derive new second derivative boundary estimates which allows us to extend some of the existence theorems of Caffarelli, Nirenberg and Spruck [4] and Ivochkina, Trundinger and Lin [19] to more general curvature functions and less convex domains.Comment: 32 pages, no figures. Final version. Paper accepted to publication in Indiana University Mathematics Journa

An Exact Approach to Early/Tardy Scheduling with Release Dates

In this paper we consider the single machine earliness/tardiness scheduling problem with di?erent release dates and no unforced idle time. The problem is decomposed into a weighted earliness subproblem and a weighted tardiness subproblem. Lower bounding procedures are proposed for each of these subproblems, and the lower bound for the original problem is then simply the sum of the lower bounds for the two subproblems. The lower bounds and several versions of a branch-and-bound algorithm are then tested on a set of randomly generated problems, and instances with up to 30 jobs are solved to optimality. To the best of our knowledge, this is the first exact approach for the early/tardy scheduling problem with release dates and no unforced idle time.scheduling, early/tardy, release dates, lower bounds, branch-and-bound

Heuristics for the Early/Tardy Scheduling Problem with Release Dates

In this paper we consider the single machine earliness/tardiness scheduling problem with di?erent release dates and no unforced idle time. We analyse the performance of several dispatch rules, a greedy procedure and a decision theory local search heuristic. The dispatch rules use a lookahead parameter whose value must be specified. We perform some experiments to determine an appropriate value for this parameter. The use of dominance rules to improve the solutions obtained by these heuristics is also considered. The computational results show that the use of the dominance rules can indeed improve the solution quality with little additional computational e?ort. To the best of our knowledge, this is the first analysis of heuristic performance for the early/tardy scheduling problem with release dates and no unforced idle time.scheduling, early/tardy, release dates, heuristics

Improved Lower Bounds for the Early/Tardy Scheduling Problem with No Idle Time

In this paper we consider the single machine earliness/tardiness scheduling problem with no idle time. Two of the lower bounds previously developed for this problem are based on lagrangean relaxation and the multiplier adjustment method, and require an initial sequence. We investigate the sensitivity of the lower bounds to the initial sequence, and experiment with di?erent dispatch rules and some dominance conditions. The computational results show that it is possible to obtain improved lower bounds by using a better initial sequence. The lower bounds are also incorporated in a branch-and-bound algorithm, and the computational tests show that one of the new lower bounds has the best performance for larger instances.scheduling, early/tardy, lower bound

Improved Heuristics for the Early/Tardy Scheduling Problem with No Idle Time

In this paper we consider the single machine earliness/tardiness scheduling problem with no idle time. We present two new heuristics, a dispatch rule and a greedy procedure, and also consider the best of the existing dispatch rules. Both dispatch rules use a lookahead parameter that had previously been set at a fixed value. We develop functions that map some instance statistics into appropriate values for that parameter. We also consider the use of dominance rules to improve the solutions obtained by the heuristics. The computational results show that the function-based versions of the heuristics outperform their fixed value counterparts and that the use of the dominance rules can indeed improve solution quality with little additional computational effort.scheduling, early/tardy, heuristics, dispatch rules, dominance rules

Beam search algorithms for the early/tardy scheduling problem with release dates

In this paper we consider the single machine earliness/tardiness scheduling problem with di?erent release dates and no unforced idle time. We present several heuristic algorithms based on the beam search technique. These algorithms include classical beam search procedures, with both priority and total cost evaluation functions, as well as the filtered and recovering variants. Both priority evaluation functions and problem-specific properties were considered for the filtering step used in the filtered and recovering beam search heuristics. Extensive preliminary tests were performed to determine appropriate values for the parameters used by each algorithm. The computational results show that the recovering beam search algorithms outperform their filtered counterparts in both solution quality and computational requirements, while the priority-based filtering procedure proves superior to the rules-based alternative. The beam search procedure with a total cost evaluation function provides very good results, but is computationally expensive and can therefore only be applied to small or medium size instances. The recovering algorithm is quite close in solution quality and is significantly faster, so it can be used to solve even large instances.scheduling, early/tardy, beam search, heuristics

Magnetoelectric response of multiferroic BiFeO3 and related materials

We present a first-principles scheme for computing the magnetoelectric response of multiferroics. We apply our method to BiFeO3 (BFO) and related compounds in which Fe is substituted by other magnetic species. We show that under certain relevant conditions -- i.e., in absence of incommensurate spin modulation, as in BFO thin films and some BFO-based solid solutions -- these materials display a large linear magnetoelectric response. Our calculations reveal the atomistic origin of the coupling and allow us to identify the most promising strategies to enhance it.Comment: 4 pages with 1 figure embedded. More information at http://www.icmab.es/dmmis/leem/jorg

Linear Theory of Electron-Plasma Waves at Arbitrary Collisionality

The dynamics of electron-plasma waves are described at arbitrary collisionality by considering the full Coulomb collision operator. The description is based on a Hermite-Laguerre decomposition of the velocity dependence of the electron distribution function. The damping rate, frequency, and eigenmode spectrum of electron-plasma waves are found as functions of the collision frequency and wavelength. A comparison is made between the collisionless Landau damping limit, the Lenard-Bernstein and Dougherty collision operators, and the electron-ion collision operator, finding large deviations in the damping rates and eigenmode spectra. A purely damped entropy mode, characteristic of a plasma where pitch-angle scattering effects are dominant with respect to collisionless effects, is shown to emerge numerically, and its dispersion relation is analytically derived. It is shown that such a mode is absent when simplified collision operators are used, and that like-particle collisions strongly influence the damping rate of the entropy mode.Comment: 23 pages, 10 figures, accepted for publication on Journal of Plasma Physic