Contenidos de fósforo total en suelos con características vérticas de la Provincia de Entre Ríos

p.53-58

Minimizing total weighted completion time in a proportionate flow shop

We study the special case of the m machine flow shop problem in which the processing time of each operation of job j is equal to pj; this variant of the flow shop problem is known as the proportionate flow shop problem. We show that for any number of machines and for any regular performance criterion we can restrict our search for an optimal schedule to permutation schedules. Moreover, we show that the problem of minimizing total weighted completion time is solvable in O(n2) time. © 1998 John Wiley & Sons, Ltd.

A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date

We develop a fully polynomial-time approximation scheme (FPTAS) for minimizing the weighted total tardiness on a single machine, provided that all due dates are equal. The FPTAS is obtained by converting an especially designed pseudopolynomial dynamic programming algorithm.

An algorithm for total variation inpainting based on nonlinear multi-grid methods

Image inpainting refers to restoring a damaged image with missing information. The total variation (TV) inpainting model is one such method that simultaneously fills in the regions with available information from their surroundings and eliminates noises. The method works well with small narrow inpainting domains. However there remains an urgent need to develop fast iterative solvers, as the underlying problem sizes are large. In addition one needs to tackle the imbalance of results between inpainting and denoising. When the inpainting regions are thick and large, the procedure of inpainting works quite slowly and usually requires a significant number of iterations and leads inevitably to oversmoothing in the outside of the inpainting domain. To overcome these difficulties, we propose a solution for TV inpainting method based on the nonlinear multi-grid algorithm.

Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval

In this note, we consider the scheduling problem of minimizing the sum of the weighted completion times on a single machine with one non-availability interval on the machine under the non-resumable scenario. Together with a recent 2-approximation algorithm designed by Kacem [I. Kacem, Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval, Computers & Industrial Engineering 54 (2008) 401–410], this paper is the first successful attempt to develop a constant ratio approximation algorithm for this problem. We present two approaches to designing such an algorithm. Our best algorithm guarantees a worst-case performance ratio of 2+ε. © 2008 Elsevier B.V. All rights reserved.

Microcoulometric Determination Of Total Organo-Chlorinepesticide And Polychlorinated Biphenyl Residues In Grey Seal (Halichoerus-Grypus) Blubber

A procedure for estimating total organochlorine pesticide and PCB residue in seal blubber at concentrations of greater than 1μg g-1 of lipid is described. Lipid is cleaned up by alumina column chromatography, and the halogen concentration of the resulting hexane eluace is determined by combustion and microcoulometry. Results are similar to those obtained by gas chromatographic analysis and can be used to interpolate between results so obtained when data on specific organochlorine compounds is not required for each sample. The organochlorine residues recovered in this manner did not constitute all the halogen determined by combustion and microcoulometry of seal lipid. Analysis by the total halogen procedure was 2.5 tunes faster than the rate achieved with a combination of liquid and gas chromatography operated manually; the requirements for laboratory equipment and space for sample preparation are reduced.