Relaxation dynamics of a broadband nanosecond acoustic pulse in a bubbly medium

The first experimental observation of the propagation dynamics of a short broadband acoustic pulse in a resonance medium with gas bubbles is carried out. The probing pulse is generated using the optoacoustic effect. It is shown that the theory of short pulse propagation in media with generalized resonance relaxation adequately and accurately describes the dynamics of short pulse dispersion. A possibility to determine the relaxation and resonance parameters of media by the pulsed testing technique is demonstrated.     

Scheduling multi-stage parallel-processor services to minimize average response time

The problem of scheduling on a multi-stage parallel-processor architecture in computer centres is addressed with the objective of minimizing average completion time of a set of requests. The problem is modelled as a flexible flowshop problem for which few heuristics exist in the flowshop scheduling literature. A new three-phase heuristic is proposed in this paper. An extensive computational experiment has been conducted to compare the performance of the existing heuristics and the proposed heuristic. The results indicate that the proposed heuristic significantly outperforms the existing ones. More specifically, the overall average error of the best existing heuristic is about five times that of the proposed heuristic while the overall average CPU time of the proposed heuristic is about half of the best existing one. More importantly, as the number of requests increases, the CPU time of the proposed heuristic decreases considerably (compared to the best existing heuristic) while the ratio of the error (of the best existing to the proposed heuristic) of about five times remains almost the same.     

Diffraction of elastic waves by a free wedge. Reduction to a singular integral equation

The problem of diffraction of a plane elastic wave by a free wedge is considered. A method of reduction of the problem to a singular integral equation is proposed.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova, Vol. 179, pp. 37–45, 1989.     

A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints

This paper considers the problem of determining the disassembly schedule (quantity and timing) of products in order to satisfy the demand of their parts or components over a finite planning horizon. The objective is to minimize the sum of set-up, disassembly operation, and inventory holding costs. As an extension of the uncapacitated versions of the problem, we consider the resource capacity restrictions over the planning horizon. An integer program is suggested to describe the problem mathematically, and to solve the problem, a heuristic is developed using a Lagrangean relaxation technique together with a method to find a good feasible solution while considering the trade-offs among different costs. The effectiveness of the algorithm is tested on a number of randomly generated problems and the test results show that the heuristic suggested in this paper can give near optimal solutions within a short amount of computation time.     

Local search algorithms for the min-max loop layout problem

In the min-max loop layout problem, machines are to be arranged around a loop of conveyor belt. The ordering of the machines dictates the number of circuits of the conveyor belt required to manufacture each of several products. The goal is to find an ordering of the machines that minimises the maximum number of circuits required for the manufacture of any of the products. Since the problem is strongly NP-hard, the study of heuristic methods is of interest. This paper proposes iterated descent and tabu search algorithms, and a randomised insertion algorithm. Results of extensive computational tests show that all of our algorithms outperform a previously known algorithm that applies a greedy heuristic to the solution of a linear programming relaxation. The best quality solutions are obtained with iterated descent. This adds further evidence to the belief that iterated descent can produce high quality solutions to a variety of combinatorial optimisation problems. Moreover, unlike some other local search algorithms, iterated descent does not require much tuning in order to be competitive.     

Combining PSMs with hard OR methods: the philosophical and practical challenges

Combinations of problem structuring methods with hard OR methodologies are seldom described in the literature. This paper will reflect on the barriers to such combinations that can be seen at the philosophical level—paradigm incommensurability—and cognitive level—type of personality and difficulty of switching paradigm. This paper examines the combination of Soft Systems Methodology and Discrete Event Simulation within an Intermediate Care case study. The paper will argue, by way of the practical application, that these problems are not insurmountable and that the result can be seen as interplay of the soft and hard paradigms. The idea of yin and yang is proposed as a metaphor for this process.     

Two-stream-like mechanism of zonal-flow generation by Rossby waves in a shallow rotating fluid

It is shown that the small-scale Rossby waves in a shallow rotating fluid placed in a gravitational field can generate large-scale zonal flows by means of a two-stream-like mechanism. This mechanism is revealed under the conditions when the Lighthill instability criterion is not satisfied. The text was submitted by the authors in English.