A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs

We consider a scheduling problem where a set of n jobs has to be processed on a set of m machines and arbitrary precedence constraints between operations are given. Moreover, for any two operations i and j values a _ij >0 and a _ji >0 may be given where a _ij is the minimal difference between the starting times of operations i and j when operation i is processed first. Often, the objective is to minimize the makespan but we consider also arbitrary regular criteria. Even the special cases of the classical job shop problem J//C_max belong to the set of NP-hard problems. Therefore, approximation or heuristic algorithms are necessary to handle large-dimension problems. Based on the mixed graph model we give a heuristic decomposition algorithm for such a problem, i.e. the initial problem is partitioned into subproblems that can be solved exactly or approximately with a small error bound. These subproblems are obtained by a relaxation of a subset of the set of undirected edges of the mixed graph. The subproblems are successively solved and a proportion of the results obtained for one subproblem is kept for further subproblem definitions. Numerical results of the algorithm presented here are given.     

Observation of isomeric states in197Bi

The high spin states of¹¹⁹Te, populated in¹¹⁰Pd(¹³C,4n) and¹¹⁰Pd(¹²C,3n) reactions, have been studied through -ray spectroscopy. The level scheme has been established upto a spin of 55/2. Three-quasiparticle states, based on g² _7/2h_11/2 and g_7/2d_5/2h_11/2 configurations, have been identified. The 35/2 and 39/2 states are suggested to be the fully aligned states constituted by five valence h_11/2 ³, g_7/2, d_5/2 quasiparticles.     

Theoretical study of thermal diffusivity of superlattices in measurements using “mirage” technique

A complete theoretical treatment for the determination of thermal diffusivity of superlattices by the mirage technique has been performed. An effective medium approximation model of the thermal conductivity and thermal diffusivity of both sublayers is presented, which is different from the simple models with the thermal diffusivity or thermal conductivity in series or parallel. The numerical calculation of the transverse component of the probe beam deflection in the mirage effect shows that the results obtained from the complete thermal-wave theory and the medium approximation model, for the optically and thermally thick superlattices, are in good agreement with each other. However, the further study on the thermally thin superlattices shows that either the series or the parallel model of the thermal conductivity should be chosen according to whether the thermal impedance of the superlattice is larger or less than that of substrate, respectively.     

Clumping Data in 2-Way Tables: A User-Orientated Perspective

Following a critique of existing algorithms, an algorithm is presented which will re-organize a 2-way data table to bring like rows together, and like columns together. Extensions of the method are described, and justified, to accommodate distances measured in modular arithmetic, and with bipolar columns/rows, as in repertory grid analysis. One value of the algorithms is that the user can see relationships in the tables without the data in the cells themselves ever having been transformed. Thus, users will continue to feel they own their data.     

Refining the Diffusion Approximation for the <Emphasis Type="Italic">GI</Emphasis><Superscript><Emphasis Type="Italic">x</Emphasis></Superscript><Emphasis Type="Italic">/G/c</Emphasis> Queue

This paper deals with the GI ^x /G/c queueing system in a steady state. We refine a diffusion approximation method incorporating the constraint of traffic conservation for general queueing systems. An approximate expression for the distribution of the number of customers is obtained. Numerical results are presented to show that the refined model provides improved performance.