The progression of industry, toward mass personalisation, initiates added complexities to the quality control and part inspection processes. Mass produced custom parts require varying, and sometimes unique inspection routines, with only certain features of a part requiring inspection. Inspection of these parts must occur at a higher frequency than batched production. This leads to an increase i...

We study permuting and batched orthogonal geometric reporting problems in the External Memory Model (EM), assuming indivisibility of the input records. Our main results are twofold. First, we prove a general simulation result that essentially shows that any permutation algorithm (resp. duplicate removal algorithm) that does αN/B I/Os (resp. to remove a fraction of the existing duplicates) can b...

Present Address Department of Computer Science & Engineering, National Institute of Technology Meghalaya, Shillong 793003, India Abstract Linear Programs (LPs) appear in a large number of applications and offloading them to a GPU is viable to gain performance. Existing work on offloading and solving an LP on a GPU suggests that there is performance gain generally on large sized LPs (typically 5...

| For batched searching of a B-tree le, previous formulas which estimate the number of block accesses fail when the blocking factor at the leaf level is less than one. We overcome this weakness by developing both an exact formula and an approximate formula to estimate the number of block accesses in a batched search of a B-tree le where the blocking factor at the leaf level may be less than one...

The general matrix-matrix multiplication (GEMM) is the most important numerical kernel in dense linear algebra, and is the key component for obtaining high performance in most LAPACK routines. As batched computations on relatively small problems continue to gain interest in many scientific applications, a need arises for a high performance GEMM kernel for batches of small matrices. Such a kerne...

We introduce a batched lazy algorithm for supervised classification using decision trees. It avoids unnecessary visits to irrelevant nodes when it is used to make predictions with either eagerly or lazily trained decision trees. A set of experiments demonstrate that the proposed algorithm can outperform both the conventional and lazy decision tree algorithms in terms of computation time as well...

This paper considers a two-stage assembly flow shop scheduling problem. When all parts of each product are completed in the first stage, they are assembled into a final product on an assembly machine in the second stage. In order to reduce the delivery cost, completed products can be held until completion of some other products to be delivered in a same batch. The proposed problem addresses sch...

We propose a simulated annealing algorithm specifically tailored to optimise total retrieval times in a multi-level warehouse under complex pre-batched picking constraints. Experiments on real data from a picker-to-parts order picking process in the warehouse of a European manufacturer show that optimal storage assignments do not necessarily display features presumed in heuristics, such as clus...