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

A greedy open shop heuristic with job priorities

The paper presents an improved version of the greedy open shop approximation algorithm with pre-ordering of jobs. It is shown that the algorithm compares favorably with the greedy algorithm with no pre-ordering by reducing either its absolute or relative error. In the case of three machines, the new algorithm creates a schedule with the makespan that is at most 3/2 times the optimal value.

A 3/2 algorithm for two-machine open shop with route-dependent processing times

This paper considers the problem of minimizing the schedule length of a two-machine shop in which not only can a job be assigned any of the two possible routes, but also the processing times depend on the chosen route. This problem is known to be NP-hard. We describe a simple approximation algorithm that guarantees a worst-case performance ratio of 2. We also present some modifications to this algorithm that improve its performance and guarantee a worst-case performance ratio of 3=2.

A polynomial algorithm for the three-machine open shop with a bottleneck machine

The paper considers the three‐machine open shop scheduling problem to minimize themakespan. It is assumed that each job consists of at most two operations, one of which is tobe processed on the bottleneck machine, the same for all jobs. A new lower bound on theoptimal makespan is derived, and a linear‐time algorithm for finding an optimalnon‐preemptive schedule is presented.

Association of fever and severe clinical course in bronchiolitis

Little attention has been given to the relation between fever and the severity of bronchiolitis. Therefore, the relation between fever and the clinical course of 90 infants (59 boys, 31 girls) hospitalised during one season with bronchiolitis was studied prospectively. Fever (defined as a single recording > 38.0°C or two successive recording > 37.8°C) was present in 28 infants. These infants were older (mean age, 5.3 v 4.0 months), had a longer mean hospital stay (4.2 v2.7 days), and a more severe clinical course (71.0%v 29.0%) than those infants without fever. Radiological abnormalities (collapse/consolidation) were found in 60.7% of the febrile group compared with 14.8% of the afebrile infants. These results suggest that monitoring of body temperature is important in bronchiolitis and that fever is likely to be associated with a more severe clinical course and radiological abnormalities.

[Book review] Chance encounters: a first course in data analysis and inference

Book review of: Chance Encounters: A First Course in Data Analysis and Inference by Christopher J. Wild and George A.F. Seber 2000, John Wiley & Sons Inc. Hard-bound, xviii + 612 pp ISBN 0-471-32936-3

Scheduling batches with sequential job processing for two-machine flow and open shops

In this paper, we study a problem of scheduling and batching on two machines in a flow-shop and open-shop environment. Each machine processes operations in batches, and the processing time of a batch is the sum of the processing times of the operations in that batch. A setup time, which depends only on the machine, is required before a batch is processed on a machine, and all jobs in a batch remain at the machine until the entire batch is processed. The aim is to make batching and sequencing decisions, which specify a partition of the jobs into batches on each machine, and a processing order of the batches on each machine, respectively, so that the makespan is minimized. The flow-shop problem is shown to be strongly NP-hard. We demonstrate that there is an optimal solution with the same batches on the two machines; we refer to these as consistent batches. A heuristic is developed that selects the best schedule among several with one, two, or three consistent batches, and is shown to have a worst-case performance ratio of 4/3. For the open-shop, we show that the problem is NP-hard in the ordinary sense. By proving the existence of an optimal solution with one, two or three consistent batches, a close relationship is established with the problem of scheduling two or three identical parallel machines to minimize the makespan. This allows a pseudo-polynomial algorithm to be derived, and various heuristic methods to be suggested.

Non-preemptive two-machine open shop scheduling with non-availability constraints

We study a two-machine open shop scheduling problem, in which the machines are not continuously available for processing. No preemption is allowed in the processing of any operation. The objective is to minimize the makespan. We consider approximability issues of the problem with more than one non-availability intervals and present an approximation algorithm with a worst-case ratio of 4/3 for the problem with a single non-availability interval.

Effect of current stressing on the reliability of 63Sn37Pb solder joints

The effect of current stressing on the reliability of 63Sn37Pb solder joints with Cu pads was investigated at temperatures of −5 °C and 125 °C up to 600 h. The samples were stressed with 3 A current (6.0 × 102 A/cm2 in the solder joint with diameter of 800 μm and 1.7 × 104 A/cm2 in the Cu trace with cross section area of 35 × 500 μm). The temperatures of the samples and interfacial reaction within the solder joints were examined. The microstructural change of the solder joints aged at 125 °C without current flow was also evaluated for comparison. It was confirmed that the current flow could cause the temperature of solder joints to rise rapidly and remarkably due to accumulation of massive Joule heat generated by the Cu trace. The solder joints stressed at 125 °C with 3 A current had an extensive growth of Cu6Sn5 and Cu3Sn intermetallic compounds (IMC) at both top and bottom solder-to-pad interfaces. It was a direct result of accelerated aging rather than an electromigration or thermomigration effect in this experiment. The kinetic is believed to be bulk diffusion controlled solid-state reaction, irrespective of the electron flow direction. When stressed at −5 °C with 3 A current, no significant change in microstructure and composition of the solder joints had occurred due to a very low diffusivity of the atoms as most Joule heat was eliminated at low temperature. The IMC evolution of the solder joints aged at 125 °C exhibited a subparabolic growth behavior, which is presumed to be a combined mechanism of grain boundary diffusion and bulk diffusion. This is mainly ascribed to the retardant effect against the diffusion course by the sufficiently thick IMC layer that was initially formed during the reflow soldering.

Transporting jobs through a two-machine open shop

We consider the two-machine open shop scheduling problem in which the jobs are brought to the system by a single transporter and moved between the processing machines by the same transporter. The purpose is to split the jobs into batches and to find the sequence of moves of the transporter so that the time by which the completed jobs are collected together on board the transporter is minimal. We present a 7/5-approximation algorithm. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009

The varieties of student experience - an open research question and some ways to answer it

Based on meetings of the Society for Research into Higher Education’s Student Experience Network over the past three years, the genuinely open research question is posed whether there is one or more undergraduate student experience within English higher education. Answering this question depends on whether what is taught or what is learnt is examined. If the latter, then a unitary student experience can be said to exist only in the narrowest of normative senses. What undergraduates actually learn – defined in the widest sense – is the $64,000 question of research on the student experience. Various ways to answer this question are proposed, including using students to research students. Conceptual tools to apply to findings can be developed from youth studies and cognate disciplines, particularly in relation to student identities and aspirations. Lastly, these proposals are placed in the wider context of comparative models of the varieties of student experience, including those emerging in the UK’s national regions.