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.     

Assessment of thermal expansion coefficient of methylsilsesquioxane thin film

For the methylsilsesquioxane film whose optical birefringence is almost zero, it was recently reported that its vertical thermal expansion coefficient (CTE) was approximately one order of magnitude larger than the lateral CTE. Though the birefringence is not an absolute predictor of anisotropic behavior, the discrepancy in both the CTEs was so remarkable that it was essential to investigate whether the anisotropy was intrinsic property or not. If the effect of Poisson's ratio is considered in the calculation of the vertical CTE and when elastic modulus measured by surface acoustic wave spectroscopy is used in the assessment of the lateral CTE, both the CTEs are coincident with each other. Therefore, it can be concluded that the discrepancy in the CTEs can be attributed to a higher in‐plane polymer chain orientation but it can also arise from the misleadingly assumed modulus and Poisson's ratio. © 2006 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 44: 3109–3120, 2006     

A family of maximal surfaces in Lorentz-Minkowski three-space

We prove the existence of an infinite family of complete spacelike maximal surfaces with singularities in Lorentz-Minkowski three-space and study their properties. These surfaces are distinguished by their number of handles and have two elliptic catenoidal ends.

     

Harmonic Analysis on the Compact Homogeneous Spaces──about Fourier Multiplier ofH~P（M） Space

ＨａｒｍｏｎｉｃＡｎａｌｙｓｉｓｏｎｔｈｅＣｏｍｐａｃｔＨｏｍｏｇｅｎｅｏｕｓＳｐａｃｅｓ──ａｂｏｕｔＦｏｕｒｉｅｒＭｕｌｔｉｐｌｉｅｒｏｆＨ~Ｐ（Ｍ）Ｓｐａｃｅ￥ＤｏｎｇＤａｏｚｈｅｎ；ＺｈｅｎｇＸｕｅａｎ（ＨｅｎａｎＵｎｉｖｅｒｓｉｔｙ，Ｋａｉ?..     

Stowage planning in maritime container transportation

We consider a stowage-planning problem of arranging containers on a container ship in the maritime transportation system. Since containers are accessible only from the top of the stack, temporary unloading and reloading of containers, called shifting, is unavoidable if a container required to be unloaded at the current port is stacked under containers to be unloaded at later ports on the route of the ship. The objective of the stowage planning problem is to minimize the time required for shifting and crane movements on a tour of a container ship while maintaining the stability of the ship. For the problem, we develop a heuristic solution method in which the problem is divided into two subproblems, one for assigning container groups into the holds and one for determining a loading pattern of containers assigned to each hold. The former subproblem is solved by a greedy heuristic based on the transportation simplex method, while the latter is solved by a tree search method. These two subproblems are solved iteratively using information obtained from solutions of each other. To see the performance of the suggested algorithm, computational tests are performed on problem instances generated based on information obtained from an ocean container liner. Results show that the suggested algorithm works better than existing algorithms.     

The vertex-cover polynomial of a graph

In this paper we define the vertex-cover polynomial Ψ(G,τ) for a graph G. The coefficient of τ^r in this polynomial is the number of vertex covers V′ of G with |V′|=r. We develop a method to calculate Ψ(G,τ). Motivated by a problem in biological systematics, we also consider the mappings f from {1, 2,…,m} into the vertex set V(G) of a graph G, subject to f⁻¹(x)f⁻¹(y)≠ for every edge xy in G. Let F(G,m) be the number of such mappings f. We show that F(G,m) can be determined from Ψ(G,τ).     

水闸闸室结构三维样条边界元分析

用三维样边界元法分析水闸闸室结构。底板，闸墩和载水墙等为其子结构，交通桥，工作桥和胸墙等处理为内部支撑。地基和边载可以是任意的，只要能给定地表位移面力关系。在各种工况下，不论是设置平板门还是弧形门，是平底板是反拱底板，即使在稀疏剖分下也能给出高精度的位移场，应力场和地基反力场。     

双包层椭圆光波导解析解

解析求解了双包层椭圆光纤中的波动方程，得到了模式精确解有模式特征方程。对基模的特征方程进行了数值计算，给出了不同椭圆比下的归一化双折射和模间色散随归一化频率的变化关系曲线，并与高斯近似解的结果进行了比较。     

On CCE graphs of doubly partial orders

Let D be a digraph. The competition-common enemy graph (CCE graph) of D has the same set of vertices as D and an edge between vertices u and v if and only if there are vertices w and x in D such that (w,u), (w,v), (u,x), and (v,x) are arcs of D. We call a graph a CCE graph if it is the CCE graph of some digraph. In this paper, we show that if the CCE graph of a doubly partial order does not contain C₄ as an induced subgraph, it is an interval graph. We also show that any interval graph together with enough isolated vertices is the CCE graph of some doubly partial order.     

Polynomial decay rate for the dissipative wave equation

Using Fourier integral operators with special amplitude functions, we analyze the stabilization of the wave equation in a three-dimensional bounded domain on which exists a trapped ray bouncing up and down infinitely between two parallel parts of the boundary.