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.

The open shop scheduling problem with a given sequence of jobs on one machine

The paper considers the open shop scheduling problem to minimize the make-span, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not allowed, the problem is NP-hard in the strong sense if the number of machines is variable, and is NP-hard in the ordinary sense in the case of two machines. For the latter case we give a heuristic algorithm that runs in linear time and produces a schedule with the makespan that is at most 5/4 times the optimal value. We also show that the two-machine problem in the nonpreemptive case is solvable in pseudopolynomial time by a dynamic programming algorithm, and that the algorithm can be converted into a fully polynomial approximation scheme. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 705–731, 1998

Temporal modelling of short-term rainfall using Cox processes

We study two marked point process models based on the Cox process. These models are used to describe the probabilistic structure of the rainfall intensity process. Mathematical formulation of the models is described and some second-moment characteristics of the rainfall depth, and aggregated processes are considered. The derived second-order properties of the accumulated rainfall amounts at different levels of aggregation are used in order to examine the model fit. A brief data analysis is presented. Copyright © 1998 John Wiley & Sons, Ltd.

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is NP-hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst-case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two-machine flow shop and the open shop problems with a single server are also shown to be NP-hard in the strong sense. However, we reduce the two-machine flow shop no-wait problem with a single server to the Gilmore-Gomory traveling salesman problem and solve it in polynomial time. (c) 2000 John Wiley & Sons, Inc.

Scheduling batches with simultaneous job processing for two-machine shop problems

We consider the problem of scheduling independent jobs on two machines in an open shop, a job shop and a flow shop environment. Both machines are batching machines, which means that several operations can be combined into a batch and processed simultaneously on a machine. The batch processing time is the maximum processing time of operations in the batch, and all operations in a batch complete at the same time. Such a situation may occur, for instance, during the final testing stage of circuit board manufacturing, where burn-in operations are performed in ovens. We consider cases in which there is no restriction on the size of a batch on a machine, and in which a machine can process only a bounded number of operations in one batch. For most of the possible combinations of restrictions, we establish the complexity status of the problem.