A characterization of network representable polymatroids

Meggido [1974] showed that the maximum flow through sets of sources in a multiple sink flow network is a polymatroidal function. Recently, Federgruen and Groenevelt [1985], [1986] have considered polymatroids that can be represented by a multiple source flow network and have improved the runnung time of an important scheduling application.We give a characterization of network representability and relate representable polymatroids to the theory of gammoids.

---

Zusammenfassung Meggido [1974] hat gezeigt, daß ein maximaler Fluß durch ein Netzwerk mit mehrfachen Senken eine polymatroidale Funktion beschreibt. Federgruen und Groenvelt [1985], [1986] haben kürzlich solche Polymatroide betrachtet, die durch Flüsse in derartigen Netzwerken repräsentiert werden können und haben so die Laufzeit einer wichtigen Schedulinganwendung verbessern können.Wir geben eine Charakterisierung von Funktionen, die durch derartige Netzflußnetzwerke realisierbar sind. Dabei stellen wir eine Verbindung her zwischen Repräsentierbarkeit und Gammoidtheorie.

     

Determination of sulphur in fly ash by instrumental proton activation analysis

A method for the determination of sulphur in fly ash by instrumental proton activation analysis using the³⁴S/p,n/^34mCl reaction was developed. The 2128.5 keV and 3305.0 keV -rays of^34mCl /t=32.0 min/ were measured on a Ge/Li/ -spectrometer, shielded with a lead absorber to attenuate low energy -rays. Irradiation and measuring conditions were optimized. The detection limit for instrumental analysis is 0.3 to 1 mg g^–1 and the standard deviation is cca. 4% for a typical sample.     

The job-shop problem and immediate selection

The job-shop problem is one of the most difficult NP-hard scheduling problems. A 10×10-problem published in 1963 has been solved only recently by Carlier and Pinson using a branch and bound method. Other branch and bound algorithms have been developed recently. The efficiency of all these branch and bound methods relies on the concept of immediate selection which allows to introduce order relations on the setI of all operations to be processed on the same machine before branching. We present new algorithms for immediate selection. Among them are

1. anO(max {n logn,f})-algorithm for fixing all disjunctions induced by cliques;
2. anO(n ²)-algorithm based on concepts which are different from those used by Carlier and Pinson.

Here,n is the number of operations inI andf is the number of induced order relations.     

Refinement of the crystal structure of (RS)-carnitine hydrochloride

A single crystal of (RS)-carnitine hydrochloride has been obtained, and its crystal structure has been refined by an x-ray structural experiment.Tashkent Pharmaceutical Institute. Translated from Khimiya Prirodnykh Soedinenii, No. 6, pp. 842–844, November–December, 1991.     

Effect of surface deactivation on molecular chemisorption: Co on αFe(100) surfaces

Clean and partially deactivated αFe(100) surfaces show variable chemical reactivity towards carbon monoxide and unsaturated hydrocarbon molecules depending on preparation. Bonding of chemisorbed CO to clean Fe occurs according to the Blyholder model. UV-photoelectron spectroscopy (UPS) indicates a severe stretching of the C-O bond at low temperatures (98°K – 223°K) and complete dissociation at higher temperatures (≈ 300°K). Electron bonding interactions can be quenched to varying degrees by prechemisorption of C, O, P, or S. UPS spectra for CO chemisorption on Fe (100) + S indicate an unstretched molecule and provide a clear resolution of the 1π and 5σ levels due to reduced forward- and back-bonding interactions. These observations are directly related to the mechanism of sulfur poisoning in Fischer-Tropsch catalysis of higher hydrocarbons. The general utility of deactivation techniques for interpretation of surface-molecule interactions is discussed.     

Verbände stetiger Funktionen und kettenwertige Homomorphismen

Ohne Zusammenfassung     

A general model for cyclic machine scheduling problems

A general framework for modeling and solving cyclic scheduling problems is presented. The objective is to minimize the cycle time. The model covers different cyclic versions of the job-shop problem found in the literature, robotic cell problems, the single hoist scheduling problem and tool transportation between the machines.It is shown that all these problems can be formulated as mixed integer linear programs which have a common structure. Small instances are solved with CPLEX. For larger instances tabu search procedures have been developed. The main ideas of these methods are indicated.