On the expected number of assignments in reduced matrices for the linear assignment problem

A linear n × n assignment problem is considered for which the elements of the cost matrix are sampled from a continuous probability distribution. Based on the zero entries of the reduced matrix the expectation of the maximum number of initial assignments is determined for general n, as well as an asymptotic value for large n

A numerical solution for the multi-server queue with hyper-exponential service times

In this paper we present a numerical method for the queue GI/H2/s, which is based on general results for GI/Hm/s. We give a complete description of the algorithm which yields exact results for the steady distributions of the actual waiting time, the virtual waiting time and the number of customers in the system both at arrival epochs and in continuous time

Multiparty Quantum Communication Using Multiqubit Entanglement and Teleportation

We propose a 2N qubit entangled channel that can be used to teleport N qubits in a network to a single receiver. We describe the structure of this channel and explicitly demonstrate how the protocol works. The channel can be used to implement a scheme in which all parties have to participate in order for the teleportation to be successful. This can be advantageous in various scenarios and we discuss the potential application of this protocol to voting

A new lower bound approach for single-machine multicriteria scheduling

The concept of maximum potential improvement has played an important role in computing lower bounds for single-machine scheduling problems with composite objective functions that are linear in the job completion times. We introduce a new method for lower bound computation; objective splitting. We show that it dominates the maximum potential improvement method in terms of speed and quality

Determination of the financial impact of machine downtime on the Australia Post large letters sorting process

Machine downtime, whether planned or unplanned, is intuitively costly to manufacturing organisations, however is often very difficult to quantify. Costing processes are rarely undertaken within manufacturing organisations. It has previously been estimated that 80% of industrial facilities were unable to accurately cost downtime, with many facilities underestimating the total cost by a factor of 200-300% (Crumrine and Post 2006). It was also acknowledged that the lack of practical guides has hindered costing procedures of any nature being implemented more readily (Dale and Plunkett 1995). Models that did exist rarely considered more than a subset of the costs identified elsewhere, leading to overly conservative estimations. In addition, because cost definitions are not consistent, methodologies for evaluating and quantifying individual costs have not previously been adequately defined. The work outlined in this paper has aimed to develop the first comprehensive methodology for determining the cost of downtime, with particular application to the Australia Post's automated mail processing machines. The method presented may be applied to any manufacturing environment which would benefit from a more complete understanding of the magnitude of the cost of machine or process downtime

Simple and insensitive bounds for a grading and an overflow model

Simple and intuitively obvious lower and upper bounds are suggested for a specific grading and an overflow model. The bounds are based on product-type modifications and are insensitive. Numerical support indicates a potential usefulness for quick engineering purposes

Searching by approximate personal-name matching

We discuss the design, building and evaluation of a method to access theinformation of a person, using his name as a search key, even if it has deformations. We present a similarity function, the DEA function, based on the probabilities of the edit operations accordingly to the involved letters and their position, and using a variable threshold. The efficacy of DEA is quantitatively evaluated, without human relevance judgments, very superior to the efficacy of known methods. A very efficient approximate search technique for the DEA function is also presented based on a compacted trie-tree structure.Postprint (published version