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.     

Interaction of metals with an organic semiconductor: Ag and In on PTCDA

The interaction of Ag and In with a thin film of 3,4,9,10-perylenetetracarboxylic dianhydride (PTCDA) was studied by near-edge X-ray absorption fine structure (NEXAFS). Upon Ag deposition on a PTCDA film of 20 nm thickness the relative intensities and lineshapes, as well as the angular dependence of the spectra remains unchanged, illustrating the formation of a chemically unreactive Ag/PTCDA interface. On the other hand, the adsorption of 0.3 nm In strongly decreases the intensity of the π^* resonances in C and O K-edge NEXAFS spectra. This is attributed to a strong charge transfer between In and PTCDA, leading to a redistribution of the charge in the molecule. However, the absence of a strong shift or new features and negligible dependence of peak intensities corresponding to π^* resonances on the In thickness indicate that the interaction between In and PTCDA is not accompanied by a covalent bond formation.     

GENERALIZED DIFFERENTIAL QUADRATURE METHOD FOR THE FREE VIBRATION OF TRUNCATED CONICAL PANELS

This paper presents an improved generalized differential quadrature (GDQ) method for the investigation of the effects of boundary conditions on the free vibration characteristics of truncated conical panels. The truncated conical panel is an important geometrical shape in the fields of aerospace, marine and structural engineering. However, despite this importance, few works in free vibration analysis have dealt with this particular geometry. In this work, the vibration characteristics of clamped and simply supported truncated conical shells are obtained for various circumferential wave numbers. Further, the effects of the vertex and subtended angles on the frequency parameters are also examined in detail. Due to limited published results in the open literature, results for a range of cases are compared with those generated from the commercial finite element solver McNeal-Schwendler Corporation Nastran, and excellent agreement is observed.     

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.     

A finite cutting plane method for facial disjunctive programs

This paper shows that any linear disjunctive program with a finite number of constraints can be transformed into an equivalent facial program. Based upon linear programming technique, a new, finite cutting plane method is presented for the facial programs.

---

Zusammenfassung Die Arbeit zeigt, daß jedes lineare disjunktive Optimierungsproblem mit endlich vielen Restriktionen in ein äquivalentes Fazetten-Problem transformiert werden kann. Auf der Grundlage von linearer Optimierungstechnik wird für das Fazetten-Problem ein neues, endliches Schnittebenenverfahren vorgestellt.

     

Smooth polynomial expansions of piecewise-differentiable functions

This paper proposes an extension of the expansions of analytic functions in the A_n polynomials defined by Adomian [1] to consider piecewise-differentiable functions.     

Formal degree and existence of stable arithmetic lattices of cuspidal representations ofp-adic reductive groups

Research at MSRI supported in part by NSF Grant DMS-812079-05