Crossdocking—JIT scheduling with time windows

In this paper, we study a problem central to crossdocking that aims to eliminate or minimize storage and order picking activity using JIT scheduling. The problem is modelled naturally as a machine scheduling problem. As the problem is NP-hard, and for real-time applications, we designed and implemented two heuristics. The first uses Squeaky Wheel Optimization embedded in a Genetic Algorithm and the second uses Linear Programming within a Genetic Algorithm. Both heuristics offer good solutions in experiments where comparisons are made with the CPLEX solver.     

Explicit 2-Factorisations of the Odd Graph

In this note we show how 1-factors in the middle two layers of the discrete cube can be used to construct 2-factors in the Odd graph (the Kneser graph of (k − 1)-sets from a (2k − 1)-set). In particular, we use the lexical matchings of Kierstead and Trotter, and the modular matchings of Duffus, Kierstead and Snevily, to give explicit constructions of two different 2-factorisations of the Odd graph. This revised version was published online in September 2006 with corrections to the Cover Date.     

A Characterisation of Posets that Are nearly Antichains

We present a characterisation of posets of size n with linear discrepancy n − 2. These are the posets that are “furthest” from a linear order without being an antichain. This revised version was published online in September 2006 with corrections to the Cover Date.     

Invariant ideals of twisted crossed products

We will prove a result concerning the inclusion of non-trivial invariant ideals inside non-trivial ideals of a twisted crossed product. We will also give results concerning the primeness and simplicity of crossed products of twisted actions of locally compact groups on -algebras. Received: 25 January 2002; in final form: 22 May 2002/Published online: 2 December 2002 This work is partially supported by Hong Kong RGC Direct Grant.     

一种改进的自适应模糊阈值图象分割方法

自适应模糊阈值图象分割方法的关键和困难在于隶属函数窗宽的自动调整和阈值搜索范围的确定.依靠图象灰度的统计特性初步确定阈值搜索范围，提出了一种改进方法，进而得到隶属函数的窗宽.实验表明这种方法避免了确定图象灰度直方图峰位置的困难，对较低亮度图象分割效果良好.     

Influence of the sample orientation in Sn<Subscript>2</Subscript>P<Subscript>2</Subscript>S<Subscript>6</Subscript> crystals on the hydrostatic piezoelectric coefficients

The influence of the sample orientation on the effective value of the hydrostatic piezoelectric coefficients d _h ⁽ⁱ⁾ of Sn₂P₂S₆ crystals has been studied. The hydrostatic piezoelectric coefficients d _h ⁽¹⁾ and d′ _h ⁽³⁾ , were measured, d _h ⁽¹⁾ =(244±3) pC/N and d′ _h ⁽³⁾ =(92±1) pC/N. The hydrostatic piezoelectric coefficient d _h ⁽³⁾ for orthogonal axis system was calculated to be d _h ⁽³⁾ =(87±2) pC/N. The, optimal orientation of the sample has been found as (Xy l)−20°-cut. Maximal value of the effective hydrostatic piezoelectric coefficient d _h ⁽¹⁾ equals 260 pC/N. Double rotated samples were also studied. The orientation of the samples insensitive to the pressure has been found. The theoretical mean value of hydrostatic piezoelectric coefficient (d _h ) _mean corresponding to randomly oriented Sn₂P₂S₆ grains in a poled composite has been calculated to be (d _h ) _mean =136 pC/N.     

Homology of Lagrangian submanifolds in cotangent bundles

In this paper we find homological restrictions on Lagrangians in cotangent bundles of spheres and Lens spaces. This research was supported by the Israel Science Foundation (grand No. 205/02).     

Multi-Item Scheduling by Benders' Decomposition

Scheduling the production of several items requires the determination of production quantities in different periods in the presence of resource constraints. Several approximate and heuristic algorithms have been proposed to solve this problem. However, no method for finding an optimal solution has as yet been developed. It is shown that the problem may be solved advantageously using Benders' decomposition. The subproblem in Benders' decomposition is shown to be a transportation problem, and some strategies for solving the master problem are indicated. The paper concludes with a sample problem demonstrating the application of the method.     

On the Convenience to Form Coalitions or Partnerships in Simple Games

A partnership in a cooperative game is a coalition that possesses an internal structure and, simultaneously, behaves as an individual member. Forming partnerships leads to a modification of the original game which differs from the quotient game that arises when one or more coalitions are actually formed. In this paper, the Shapley value is used to discuss the convenience to form either coalitions or partnerships. To this end, the difference between the additive Shapley value of the partnership in the partnership game and the Shapley alliance value of the coalition, and also between the corresponding value of the internal and external players, are analysed. Simple games are especially considered. Research partially supported by Grant BFM 2003-01314 of the Science and Technology Spanish Ministry and the European Regional Development Fund.