Iron ore production scheduling to improve product quality

Iron ore quality depends upon successive shipments being uniform in composition, not only in iron but also in several other minerals. The production process involves several stages of scheduling, from the mine face, through railing, stockpiling and ship loading. At each of these stages there is potential to improve the composition uniformity through appropriate scheduling procedures. This paper discusses a variety of algorithms and simulation models developed to aid these scheduling decisions.     

Dynamic overbooking scheduling system to improve patient access

Patient no-show has long been a recognized problem in modern outpatient health-care delivery systems. The common impacts are reduced clinic efficiency and provider productivity, wasted medical resources, increased health-care cost and limited patient access to care. The main goal of this research is to develop an effective dynamic overbooking policy into any scheduling system that accounts for the predictive probability of no-shows for any given patient. This policy increases the quality of patient care in terms of wait time and access to care while minimizing the clinic's costs. This proposed model is also illustrated to be more cost-effective than overbooking patients evenly throughout a clinic session. This paper also suggests that overbooking should be performed at better patient flow and higher no-show rate so that the costs are minimized. Consequently, this research improves the outpatient experience for both patients and medical providers.     

Allocation of resources according to a fractional objective

The problem considered is that of the allocation of resources to activities according to a fractional measure given by the ratio of “return” to “cost”. The return is the sum of returns from the activities, each activity being described by a concave return function. There is a positive fixed cost and a variable cost that depend linearly on the allocations. Properties related to the uniqueness of optimal solutions and the number of non-zero allocations are derived. A method is given by which any set of feasible allocations can be used to derive an upper bound of the optimal value of the objective function: optimal and almost-optimal allocations can be recognized. Allocations can be generated by a fast incremental method that is described. The method utilizes data in sequential order and can be used to solve large problems.     

ON THE CENTRAL LIMIT THEOREM IN PRODUCT SPACES

ＯＮＴＨＥＣＥＮＴＲＡＬＬＩＭＩＴＴＨＥＯＲＥＭＩＮＰＲＯＤＵＣＴＳＰＡＣＥＳＳＵＺＨＯＮＧＧＥＮＡｂｓｔｒａｃｔ：ＳｕｐｐｏｓｅｔｈａｔＥａｎｄＦａｒｅｓｅｐａｒａｂｌｅＢａｎａｃｈｓｐａｃｅｓ，ＸａｎｄＹａｒｅｉｎｄｅｐｅｎｄｅｎｔｓｙｍｍｅｔｒ...     

Minimaxity and admissibility of the product limit estimator

In this article we examine the minimaxity and admissibility of the product limit (PL) estimator under the loss function% MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqaqpepeea0xe9qqVa0l% b9peea0lb9sq-JfrVkFHe9peea0dXdarVe0Fb9pgea0xa9pue9Fve9% Ffc8meGabaqaciGacaGaaeqabaWaaeaaeaaakeaacaWGmbGaaiikai% aadAeacaGGSaGabmOrayaajaGaaiykaiabg2da9maapeaabaGaaiik% aiaadAeacaGGOaGaamiDaiaacMcaaSqabeqaniabgUIiYdGccqGHsi% slceWGgbGbaKaacaGGOaGaamiDaiaacMcacaGGPaWaaWbaaSqabeaa% caaIYaaaaOGaamOramaaCaaaleqabaaccmGae8xSdegaaOGaaiikai% aadshacaGGPaGaaiikaiaaigdacqGHsislcaWGgbGaaiikaiaadsha% caGGPaGaaiykamaaCaaaleqabaGaeqOSdigaaOGaamizaiaadEfaca% GGOaGaamiDaiaacMcaaaa!5992!\[L(F,\hat F) = \int {(F(t)} - \hat F(t))^2 F^\alpha (t)(1 - F(t))^\beta dW(t)\].To avoid some pathological and uninteresting cases, we restrict the parameter space to ={F: F(ymin) }, where (0, 1) and y ₁,...y,_n are the censoring times. Under this set up, we obtain several interesting results. When y ₁=···=y _n, we prove the following results: the PL estimator is admissible under the above loss function for , {–1, 0}; if n=1, ==–1, the PL estimator is minimax iff dW ({y})=0; and if n2, , {–1, 0}, the PL estimator is not minimax for certain ranges of . For the general case of a random right censorship model it is shown that the PL estimator is neither admissible nor minimax. Some additional results are also indicated.Partially supported by the Governor's Challenge Grant.Part of the work was done while the author was visiting William Paterson College.     

A LIL type result for the product limit estimator

Summary Let X ₁,X ₂,...,X _n be i.i.d. r.v.'-s with P(X>u)=F(u) and Y ₁,Y ₂,...,Y _n be i.i.d. P(Y>u)=G(u) where both F and G are unknown continuous survival functions. For i=1,2,...,n set _i=1 if X _i Y _i and 0 if X _i >y _i , and Z _i =min {itX_i, Y_i}. One way to estimate F from the observations (Z _i , _i ) i=l,...,n is by means of the product limit (P.L.) estimator F _n ^* (Kaplan-Meier, 1958 [6]).In this paper it is shown that F _n ^* is uniformly almost sure consistent with rate O(log logn/n), that is P(sup ¦F _n ^* (u)– F(u)¦=0(log log n/n)=1 –<u<+ if G(T _F )>0, where T _F =sup{x F(x)>0}.A similar result is proved for the Bayesian estimator [9] of F. Moreover a sharpening of the exponential bound of [3] is given.     

On the limit of a product of matrix exponentials

The existence of the limit as ε→0 exp[(A+B/ε)t] exp[-Bt/ε]is studied for n×n matrices A,B. Necessary and sufficient conditions on B that the limit exist for all A are given.     

A note on multiproject scheduling to minimize the cost of supplemental external resources

The employment of external resources to supplement available internal resources can improve a feasible schedule or make an infeasible schedule feasible. Based upon a well-known integer linear programming approach to the general multiproject scheduling problem, this paper provides an extension to account for the minimum cost usage of external resources. We modify an example from the literature to illustrate the solution of the revised model. Another approach using Lagrange multipliers is also discussed.

---

Zusammenfassung Es wird gezeigt, wie bei Problemen der Ablaufplanung durch zusätzliche externe Ressourcen, z.B. vorübergehend beschäftigte Arbeitnehmer, ein zulässiger Ablaufplan bezüglich einer gegebenen Zielfunktion verbessert werden kann bzw. überhaupt erst ein zulässiger Ablaufplan ermöglicht wird. Unter diesem Aspekt werden zwei Entscheidungsmodelle der Ablaufplanung, und zwar vonPritsker/Watters/Wolfe undFisher, modifiziert.

     

Control according to a quality criterion with classification errors

Translated from Statisticheskie Metody Otsenivaniya i Proverki Gipotez, PP. 77–83, 1984.     

Central limit theorem and almost sure central limit theorem for the product of some partial sums

In this paper, we give the central limit theorem and almost sure central limit theorem for products of some partial sums of independent identically distributed random variables.     

Computing redundant resources for the resource constrained project scheduling problem

Several efficient lower bounds and time-bound adjustment methods for the resource constrained project scheduling problem (RCPSP) have recently been proposed. Some of them are based on redundant resources. In this paper we define redundant functions which are very useful for computing redundant resources. We also describe an algorithm for computing all maximal redundant functions. Once all these redundant functions have been determined, we have to identify those that are useful for bounding. Surprisingly, their number is reasonable even for large resource capacities, so a representative subset of them can be tabulated to be used efficiently. Computational results on classical RCPSP instances confirm their usefulness.     

Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times

A modified flow-shop scheduling problem for a production system, characterized by parts machining followed by their subsequent assembly (joining) operation, is studied. Several products of different kinds are ordered. Each part for the products is processed on machine M₁ (the first stage) and then processed on machine M₂ (the second stage). Each product is processed (e.g., joined) with the parts by one assembly operation on assembly stage M_A (the third stage). The objective function to be minimized is the weighted sum of product completion times. The decision variables are the sequence of products to be assembled and the sequence of parts to be processed. In this paper, we assume that if product h is assembled before product h^′, then, on each machine, processing of any part for product h^′ is done after processing of all parts for product h is completed. We call this assumption “Assumption B(2)” and call this problem “SP_constrained”. An efficient solution procedure using a branch and bound method is developed based on this assumption, where Johnson's algorithm is used as a part of the solution procedure. Computational experiments are provided to evaluate the performance of the solution procedure. It has been found that the proposed solution procedure is effective to obtain an optimal or ε-optimal solution for larger-scaled problems. We further compare the optimal value for SP_constrained with the optimal value for another problem SP_{unconstrained} defined without Assumption B(2); the optimal solution for SP_{unconstrained} being significantly more difficult to obtain. We offer three propositions to analyze some special cases in which the difference between the optimal value of SP_constrained and the optimal value of SP_{unconstrained} is zero. For general cases, we make some computational experiments to evaluate the difference between the optimal value of SP_constrained and the optimal value of SP_{unconstrained}. It has been found that the difference is very small.     

Classical limit of the tensor product of holomorphic discrete series representations

For three coadjoint orbits \(\mathcal {O}_1, \mathcal {O}_2\) and \(\mathcal {O}_3\) in \(\mathfrak {g}^*\) , the Corwin–Greenleaf function \(n(\mathcal {O}_1 \times \mathcal {O}_2, \mathcal {O}_3)\) is given by the number of \(G\) -orbits in \(\{(\lambda , \mu ) \in \mathcal {O}_1 \times \mathcal {O}_2 \, : \, \lambda + \mu \in \mathcal {O}_3 \}\) under the diagonal action. In the case where \(G\) is a simple Lie group of Hermitian type, we give an explicit formula of \(n(\mathcal {O}_1 \times \mathcal {O}_2, \mathcal {O}_3)\) for coadjoint orbits \(\mathcal {O}_1\) and \(\mathcal {O}_2\) that meet \(\left( [\mathfrak {k}, \mathfrak {k}] + \mathfrak {p}\right) ^{\perp }\) , and show that the formula is regarded as the ‘classical limit’ of a special case of Kobayashi’s multiplicity-free theorem (Progr. Math. 2007) in the branching law to symmetric pairs.     

The limit of the product of the parameterized exponentials of two operators

Given two self-adjoint, positive, compact operators A,B on a separable Hilbert space, we show that there exists a self-adjoint, positive, compact operator C commuting with B such that

Full-size image

.     

On limit theorem for the eigenvalues of product of two random matrices

The existence of limiting spectral distribution (LSD) of the product of two random matrices is proved. One of the random matrices is a sample covariance matrix and the other is an arbitrary Hermitian matrix. Specially, the density function of LSD of S_nW_n is established, where S_n is a sample covariance matrix and W_n is Wigner matrix.