Lead time is one of the major limits that affect planning at every stage of the supply chain system. In this paper, we study a continuous review inventory model. This paper investigates the ordering cost reductions are dependent on lead time. This study addressed two-echelon supply chain problem consisting of a single vendor and a single buyer. The main contribution of this study is that the in...

Motivated by a Bayesian framework, we propose a new minimum aberration type criterion for designing experiments with twoand four-level factors. The Bayesian approach helps in overcoming the ad hoc nature of effect ordering in the existing minimum aberration type criteria. Moreover, the approach is also capable of distinguishing between qualitative and quantitative factors. Numerous examples are...

This work approaches human chromosome mapping by developing algorithms for ordering markers associated with radiation hybrid data. Motivated by recent work of Boehnke et al. [1], we formulate the ordering problem by developing stochastic spin models to search for minimum-break marker configurations. As a particular application, the methods developed are applied to 14 human chromosome-21 markers...

Motivated by a Bayesian framework, we propose a new minimum aberration-type criterion for designing experiments with twoand four-level factors. The Bayesian approach helps in overcoming the ad hoc nature of effect ordering in the existing minimum aberration-type criteria. The approach is also capable of distinguishing between qualitative and quantitative factors. Numerous examples are given to ...

The problem of allocating maxmin rates with minimum rate constraints for connection-oriented networks is considered. This paper proves that the convergence of maxmin rate allocation satisfies a partial ordering in the bottleneck links. This partial ordering leads to a tighter lower bound for the convergence time for any maxmin protocol. An optimally fast maxmin rate allocation protocol called t...

A bipartite graph is chordal bipartite if every cycle of length at least 6 has a chord in it. In this paper, we investigate the structure of $P_5$-free chordal bipartite graphs and show that these graphs have a Nested Neighborhood Ordering, a special ordering among its vertices. Further, using this ordering, we present polynomial-time algorithms for classical problems such as Hamiltonian cycle ...

We identify ground-state collinear spin ordering in various antiferromagnetic transition metal oxides by constructing the Ising model from first-principles results and applying a genetic algorithm to find its minimum energy state. The present method can correctly reproduce the ground state of well-known antiferromagnetic oxides such as NiO, Fe2O3, Cr2O3 and MnO2. Furthermore, we identify the gr...

A new ordering, extending the notion of universal cycles of Chung et al. (1992), is proposed for the blocks of k-uniform set systems. Existence of minimum coverings of pairs by triples that possess such an ordering is established for all orders. The application to the construction of short 2-radius sequences is given, along with some new 2-radius sequences found through a computer search.

We prove a relationship between the Cleaning problem and the Balanced Vertex– Ordering problem, namely that the minimum total imbalance of a graph equals twice the brush number of a graph. This equality has consequences for both problems. On one hand, it allows us to prove the NP-completeness of the Cleaning problem, which was conjectured by Messinger et al. [7]. On the other hand, it also enab...

The core cover of a TU-game is a superset of the core and equals the convex hull of its larginal vectors. A larginal vector corresponds to an ordering of the players and describes the efficient payoff vector giving the first players in the ordering their utopia demand as long as it is still possible to assign the remaining players at least their minimum right. A game is called compromise stable...