Pharmazeutische Pr?parate

Ohne Zusammenfassung     

Analysis and interpretation of new low-energy \pi\pi scattering data

The recently published E865 data on charged decays and phases are reanalyzed to extract values of the two S-wave scattering lengths, of the subthreshold parameters and , of the low-energy constants and as well as of the main two-flavour order parameters: and in the limit taken at the physical value of the strange quark mass. Our analysis is exclusively based on direct experimental information on phases below 800 MeV and on the new solutions of the Roy equations by Ananthanarayan et al. The result is compared with the theoretical prediction relating 2a ₀ ⁰-5a ₀ ² and the scalar radius of the pion, which was obtained in two-loop Chiral Perturbation Theory. A discrepancy at the 1- level is found and commented upon. Received: 11 December 2001 / Revised version: 28 March 2002 / Published online: 7 June 2002     

Scheduling Parts in a Combined Production-transportation Work Cell

This paper is concerned with a combined production-transportation scheduling problem. The problem comprises a simple, two-machine, automated manufacturing cell, which either stands alone or is a subunit of a complete flexible manufacturing system. The cell consists of two machines in series with a dedicated part-handling device such as a crane or robotic arm for transferring parts from the first machine to the second. The loading of a new piece on the first machine and the ejection of a finished piece from the second machine are performed by dedicated automated mechanisms. The introduction of parts into the system is done n at a time, whereby the parts are reshuffled into a sequence that minimizes completion time. All processing and transfer times are considered deterministic—a reasonable assumption for a cell comprising a robotic transfer device and two CNC machining units. What complicates the problem is the assumption of a non-negligible time for the transfer device to return (empty) from the second machine to the first. The operation is a generalization of a two-machine flowshop problem, and is formulated as a specially structured, asymmetric travelling salesman problem. An approximate polynomial time 0(n log n) algorithm is proffered. The procedure incorporates a lower bound using the Gilmore–Gomory algorithm for the no-wait, two-machine flowshop problem.