Two-machine open shop scheduling with special transportation times

The paper considers a problem of scheduling n jobs in a two-machine open shop to minimise the makespan, provided that preemption is not allowed and the interstage transportation times are involved. In general, this problem is known to be NP-hard. We present a linear time algorithm that finds an optimal schedule if no transportation time exceeds the smallest of the processing times. We also describe an algorithm that creates a heuristic solution to the problem with job-independent transportation times. Our algorithm provides a worst-case performance ratio of 8/5 if the transportation time of a job depends on the assigned processing route. The ratio reduces to 3/2 if all transportation times are equal.

Turbulence modelling for thermal management of electronic systems

The electronics industry is developing rapidly together with the increasingly complex problem of microelectronic equipment cooling. It has now become necessary for thermal design engineers to consider the problem of equipment cooling at some level. The use of Computational Fluid Dynamics (CFD) for such investigations is fast becoming a powerful and almost essential tool for the design, development and optimisation of engineering applications. However turbulence models remain a key issue when tackling such flow phenomena. The reliability of CFD analysis depends heavily on the turbulence model employed together with the wall functions implemented. In order to resolve the abrupt fluctuations experienced by the turbulent energy and other parameters located at near wall regions and shear layers a particularly fine computational mesh is necessary which inevitably increases the computer storage and run-time requirements. This paper will discuss results from an investigation into the accuract of currently used turbulence models. Also a newly formulated transitional hybrid turbulence model will be introduced with comparisonsaagainst experimental data.

Fast divide-and-conquer algorithms for preemptive scheduling problems with controllable processing times - a polymatroid optimization approach

We consider a variety of preemptive scheduling problems with controllable processing times on a single machine and on identical/uniform parallel machines, where the objective is to minimize the total compression cost. In this paper, we propose fast divide-and-conquer algorithms for these scheduling problems. Our approach is based on the observation that each scheduling problem we discuss can be formulated as a polymatroid optimization problem. We develop a novel divide-and-conquer technique for the polymatroid optimization problem and then apply it to each scheduling problem. We show that each scheduling problem can be solved in $ \O({\rm T}_{\rm feas}(n) \times\log n)$ time by using our divide-and-conquer technique, where n is the number of jobs and Tfeas(n) denotes the time complexity of the corresponding feasible scheduling problem with n jobs. This approach yields faster algorithms for most of the scheduling problems discussed in this paper.

Central nervous system drugs: Low temperature X-ray structures of (I) the base 5-(2,3-dichlorophenyl)-2,4-diamino-6-fluoromethyl-pyrimidine (4030W92) and (II) 5-(2,6-dichlorophenyl)-1-H-2,4-diamino-6-methyl-pyrimidine methanesulphonic acid salt (227C89)

The X-ray crystal structures of (I), the base 4030W92, 5-(2,3-dichlorophenyl)-2,4-diamino-6-fluoromethyl-pyrimidine, C11H9Cl2FN4, and (II) 227C89, the methanesulphonic acid salt of 5-(2,6-dichlorophenyl)-1-H-2,4-diamino-6-methyl-pyrimidine, C11H11Cl2N4 center dot CH3O3S, have been carried out at low temperature. A detailed comparison of the two structures is given. Structure (I) is non-centrosymmetric, crystallizing in space group P2(1) with unit cell a = 10.821(3), b = 8.290(3), c = 13.819(4) angstrom, beta = 105.980(6)degrees, V = 1191.8(6) angstrom(3), Z = 4 (two molecules per asymmetric unit) and density (calculated) = 1.600 mg/m(3). Structure (II) crystallizes in the triclinic space group P (1) over bar with unit cell a = 7.686(2), b = 8.233(2), c = 12.234(2) angstrom, alpha = 78.379(4), beta = 87.195(4), gamma = 86.811(4)degrees, V = 756.6(2) angstrom(3), Z = 2, density (calculated) = 1.603 mg/m(3). Final R indices [I > 2sigma(I)] are R1 = 0.0572, wR2 = 0.1003 for (I) and R1 = 0.0558, wR2 = 0.0982 for (II). R indices (all data) are R1 = 0.0983, wR2 = 0.1116 for (I) and R1 = 0.1009, wR2 = 0.1117 for (II). 5- Phenyl-2,4 diaminopyrimidine and 6-phenyl-1,2,4 triazine derivatives, which include lamotrigine (3,5-diamino-6-(2,3-dichlorophenyl)-1,2,4-triazine), have been investigated for some time for their effects on the central nervous system. The three dimensional structures reported here form part of a newly developed data base for the detailed investigation of members of this structural series and their biological activities.