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.     

Analysis of finite dimensional approximations to a class of partial differential equations

In this paper, a unified approach for analysing finite dimensional approximations to a class of partial differential equations boundary value problems (second‐kind Fredholm differential equations) is introduced. The approach is shown to be general despite of its extremely simple form. In particular, it is expected to be useful in the convergence analysis of finite element methods for solving PDE problems. Three specific examples are presented to illustrate the broad applicability of the approach. Copyright © 2004 John Wiley & Sons, Ltd.     

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.     

A Constant Bound for Geometric Permutations of Disjoint Unit Balls

   Abstract. We prove that a set of n disjoint unit balls in R ^d admits at most four distinct geometric permutations, or line transversals, thus settling a long-standing conjecture in combinatorial geometry. The constant bound significantly improves upon the Θ (n ^d-1 ) bound for disjoint balls of unrestricted radii.     

r－不可分矩阵的本原指数（Ⅱ）

本文给出了 n阶 r-不可分矩阵的本原指数的上界 ,即任 n阶 r—不可分矩阵 A的本原指数 (A)≤n+(r- ) 2r (1≤ r相似文献   

ON A SET OF h-HARMONIC HOMOGENEOUS POLYNOMIALS

1　IntroductionLet Sd- 1 bethe unitsphere of Rd,Πdthe space of allpolynomialsofd variables,and x(i)= (x1 ,… ,xi) (i=1 ,… ,d) .In this paper,we are concerned with the homogeneous polyno-mials orthogonal with the weightfunction h(x(d) ) =x2 k11 …x2 kdd on Sd- 1 ,where ki≥ 0 (i=1 ,… ,d) .Connected with the weightfunction h(x(d) ) are the following differential-differenceoperators introduced by Charles F. Dunkl in [3 ] ,Dip(x(d) ) = p(x(d) ) xi+ di=1kip(x(d) ) -p(x1 ,… ,-xi,… ,xd)xi,Δ…     

硅基两维光子晶体的制备和光子带隙特性

利用反应离子束刻蚀设备制备了硅基的两维空气柱光子晶体，并用红外显微镜测试了样品的 反射谱. 理论上用时域有限差分(FDTD)方法计算了样品的光子带隙，从测试结果看光子带隙 和理论计算的光子带隙符合得很好.  关键词： 光子晶体 光子带隙 反射谱 时域有限差方法