Minimizing makespan on a single machine subject to random breakdowns

We investigate optimal sequencing policies for the expected makespan problem with an unreliable machine, where jobs have to be reprocessed in their entirety if preemptions occur because of breakdowns. We identify a class of uptime distributions under which LPT minimizes expected makespan.     

Application of N,N‐bis(diphenylphosphino)aniline palladium(II) complexes as pre‐catalysts in Heck coupling reactions

Palladium(II) complexes with N,N‐bis(diphenylphosphino)aniline ligands catalyse the Heck reaction between styrene and aryl bromides, affording stilbenes in good yield. The structures of two of the complexes used as pre‐catalysts have been determined by single‐crystal X‐ray diffraction. Copyright © 2007 John Wiley & Sons, Ltd.     

Mode beating in spot-size converter lasers

An anomalous modulation in the wavelength spectrum has been observed in lasers with spot-size converters. This intensity modulation is shown to be caused by beating between the fundamental lasing mode and radiation modes in the taper. This results in a periodic modulation in the net gain spectrum, which causes wavelength jumps between adjacent net gain maxima, and a drive current dependent spectral width that is expected to affect system performance. The amplitude of this spectral modulation is reduced significantly by either using an angled rear-facet which reflects the beating radiation modes away from the laser axis, or by using a nonlinear, adiabatic taper.     

Packing Non-Zero A-Paths In Group-Labelled Graphs

Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group Γ and let A⊂V. An A-path is a path whose ends are both in A. The weight of a path P in G is the sum of the group values on forward oriented arcs minus the sum of the backward oriented arcs in P. (If Γ is not abelian, we sum the labels in their order along the path.) We are interested in the maximum number of vertex-disjoint A-paths each of non-zero weight. When A = V this problem is equivalent to the maximum matching problem. The general case also includes Mader's S-paths problem. We prove that for any positive integer k, either there are k vertex-disjoint A-paths each of non-zero weight, or there is a set of at most 2k −2 vertices that meets each of the non-zero A-paths. This result is obtained as a consequence of an exact min-max theorem. These results were obtained at a workshop on Structural Graph Theory at the PIMS Institute in Vancouver, Canada. This research was partially conducted during the period the first author served as a Clay Mathematics Institute Long-Term Prize Fellow.