考虑不完美检测的两阶段点检与备件订购策略联合优化

针对设备维修与备件管理相互影响与制约的问题, 在基于延迟时间理论的基础上, 提出了两阶段点检与备件订购策略联合优化。点检是不完美的, 当点检识别设备的缺陷状态时, 进行预防更新; 设备故障时, 进行故障更新。结合设备更新时备件的状态, 采用更新报酬理论建立了以第一阶段点检时间、第二阶段点检周期和备件订购时间为决策变量, 以最小化单位时间期望成本为目标的模型。最后, 通过人工蜂群算法对模型求解, 并在数值分析中将两阶段点检策略与定期点检策略进行比较, 结果表明:两阶段点检策略始终优于定期点检策略, 验证了所建模型的有效性。     

Optimal lateral transshipment policies for a two location inventory problem with multiple demand classes

We consider an inventory model for spare parts with two stockpoints, providing repairable parts for a critical component of advanced technical systems. As downtime costs for these systems are expensive, ready–for–use spare parts are kept in stock to be able to quickly respond to a breakdown of a system. We allow for lateral transshipments of parts between the stockpoints upon a demand arrival. Each stockpoint faces demands from multiple demand classes. We are interested in the optimal lateral transshipment policy. There are three ways in which a demand can by satisfied: from own stock, via a lateral transshipment, or via an emergency procedure. Using stochastic dynamic programming, we characterize and prove the structure of the optimal policy, that is, the policy for satisfying the demands which minimizes the average operating costs of the system. This optimal policy is a threshold type policy, with state-dependent thresholds at each stockpoint for every demand class. We show a partial ordering in these thresholds in the demand classes. In addition, we derive conditions under which the so-called hold back and complete pooling policies are optimal, two policies that are often assumed in the literature. Furthermore, we study several model extensions which fit in the same modeling framework.     

Analysis of optimal opportunistic replenishment policies for inventory systems by using a (s,S) model with a maximum issue quantity restriction

The analysis of optimal inventory replenishment policies for items having lumpy demand patterns is difficult, and has not been studied extensively although these items constitute an appreciable portion of inventory populations in parts and supplies types of stockholdings. This paper studies the control of an inventory item when the demand is lumpy. A continuous review (s,S) policy with a maximum issue quantity restriction and with the possibility of opportunistic replenishment is proposed to avoid the stock of these items being depleted unduly when all the customer orders are satisfied from the available inventory and to reduce ordering cost by coordinating inventory replenishments. The nature of the customer demands is approximated by a compound Poisson distribution. When a customer order arrives, if the order size is greater than the maximum issue quantity w, the order is satisfied by placing a special replenishment order rather than from the available stock directly. In addition, if the current inventory position is equal to or below a critical level A when such an order arrives, an opportunistic replenishment order which combines the special replenishment order and the regular replenishment order will be placed, in order to satisfy the customer's demand and to bring the inventory position to S. In this paper, the properties of the cost function of such an inventory system with respect to the control parameters s, S and A are analysed in detail. An algorithm is developed to determine the global optimal values of the control parameters. Indeed, the incorporation of the maximum issue quantity and opportunistic replenishment into the (s,S) policy reduces the total operating cost of the inventory system.     

Joint pricing and inventory control with a Markovian demand model

We consider the joint pricing and inventory control problem for a single product over a finite horizon and with periodic review. The demand distribution in each period is determined by an exogenous Markov chain. Pricing and ordering decisions are made at the beginning of each period and all shortages are backlogged. The surplus costs as well as fixed and variable costs are state dependent. We show the existence of an optimal (s, S, p)-type feedback policy for the additive demand model. We extend the model to the case of emergency orders. We compute the optimal policy for a class of Markovian demand and illustrate the benefits of dynamic pricing over fixed pricing through numerical examples. The results indicate that it is more beneficial to implement dynamic pricing in a Markovian demand environment with a high fixed ordering cost or with high demand variability.     

On the commutant algebras corresponding to the permutation representations of the full collineation groups of PG(k,s) and EG(k,s), s = pr,k ⩾ 2

In this paper, the dimension t and a linear basis of the commutant algebra corresponding to the representation of the full collineation group as matrices permuting the flags (incident point-line or point-hyperplane pairs) have been determined for each one of the four geometries PG(2, s), EG(2, s), PG(k, s), and EG(k, s), s = p^r, k ? 3. For the four geometries, t = 6, 7, 7, and 8, respectively, and the corresponding linear bases are (I, G, B, T, BT, TB), (I, G, B, T, BT, TB, BTB), (I, G, B, T, BT, TB, S), and (I, G, B, T, BT, TB, BTB, S). I, G, B, T are the relationship matrices of James (Ann. Math. Statist.28 (1957), 993–1082) and the matrix S was introduced by Sysoev and Shaikin (Avtomat. i Telemekh.5 (1976), 64–73).     

A condition-based replacement and spare provisioning policy for deteriorating systems with uncertain deterioration to failure

A new policy, referred to as the condition-based replacement and spare provisioning policy, is presented for deteriorating systems with a number of identical units. It combines the condition-based replacement policy with periodical inspections and the (S,s$S\text{,}s$) type inventory policy, noted as the (T,S,s,_Lp$T\text{,}S\text{,}s\text{,}{L}_{\text{p}}$) policy, where T is the inspection interval, S is the maximum stock level, s   is the reorder level, and _Lp$L_{\text{p}}$ is the preventive replacement threshold for the deterioration levels of units. The deterioration level of each unit in the system can be described by a scalar random variable, which is continuous and increasing monotonically. Furthermore, the deterioration level just when the unit failure occurs, termed deterioration to failure, is uncertain. Therefore, the condition-based reliability is proposed in order to characterize various and uncertain deterioration levels when unit failure occurs. A simulation model is developed for the system operation under the proposed condition-based replacement and spare provisioning policy. Thus, via the simulation method and the genetic algorithm, the decision variables T, S, s  , and _Lp$L_{\text{p}}$ can be jointly optimized for minimizing the cost rate. A case study is given, showing the procedure of applying the proposed policy and the condition-based reliability methodology to optimizing the maintenance scheme of haul truck motors at a mine site based on oil inspections, and proving beneficial for plant maintenance managers to reduce maintenance cost.     

Sets in Abelian groups with distinct sums of pairs

A subset S={s₁,…,sk} of an Abelian group G is called an St-set of size k if all sums of t different elements in S are distinct. Let s(G) denote the cardinality of the largest S₂-set in G. Let v(k) denote the order of the smallest Abelian group for which s(G)?k. In this article, bounds for s(G) are developed and v(k) is determined for k?15 by computing s(G) for Abelian groups of order up to 183 using exhaustive backtrack search with isomorph rejection.     

Inventory control in multi-channel retail

In recent years multi-channel retail systems have received increasing interest. Partly due to growing online business that serves as a second sales channel for many firms, offering channel specific prices has become a common form of revenue management. We analyze conditions for known inventory control policies to be optimal in presence of two different sales channels. We propose a single item lost sales model with a lead time of zero, periodic review and nonlinear non-stationary cost components without rationing to realistically represent a typical web-based retail scenario. We analyze three variants of the model with different arrival processes: demand not following any particular distribution, Poisson distributed demand and a batch arrival process where demand follows a Pòlya frequency type distribution. We show that without further assumptions on the arrival process, relatively strict conditions must be imposed on the penalty cost in order to achieve optimality of the base stock policy. We also show that for a Poisson arrival process with fixed ordering costs the model with two sales channels can be transformed into the well known model with a single channel where mild conditions yield optimality of an (s, S) policy. Conditions for optimality of the base stock and (s, S) policy for the batch arrival process with and without fixed ordering costs, respectively, are presented together with a proof that the batch arrival process provides valid upper and lower bounds for the optimal value function.     

Inventory control with indivisible units of stock transfer

We consider an infinite horizon, single item inventory model with backorders and a fixed lead time. Demand is stationary stochastic and review is periodic. Inventory may only be replenished in multiples of a fixed package size q but demands may be of any size. Ordering costs are linear and combined holding and shortage costs can be expressed as a convex function of the inventory position. The control policy is defined as (s, S, q), where an order is placed if the inventory position falls to or below s and the order size is the largest multiple of q which results in the inventory position not exceeding S. The parameters s and S are restricted to be multiples of q. The objective is to find the control policy that minimizes the long run average cost per unit time. The optimal solution procedure requires renewal theory and a structured search. Fortunately, a heuristic based on the ‘quantized ordering’ approach of Zheng and Chen provides solutions that are near optimal over a broad range of parameter values.     

Joint optimization of spare parts ordering and maintenance policies for multiple identical items subject to silent failures

In this paper the joint maintenance and spare parts ordering problem for more than one identical operating items is studied. The operating items may suffer two types of silent failures: a minor failure, which results in item malfunctioning, and a major failure, which renders the item completely out-of-function. Inspections are periodically held to detect any failures and the inspected items are preventively maintained, repaired or replaced according to their condition. Two ordering policies are investigated to supply the necessary spare parts: a periodic review and a continuous review policy. The expected total maintenance and inventory cost per time unit is derived and the proposed models are optimized for real case data. In addition, the sensitivity of the proposed models is studied through numerical examples and the effect of some key problem characteristics on the optimal decisions is discussed.     

Stirling polynomials

An investigation is made of the polynomials f_k(n) = S(n + k, n) and g_k(n) = (?1)^ks(n, n ? k), where S and s denote the Stirling numbers of the second and first kind, respectively. The main result gives a combinatorial interpretation of the coefficients of the polynomial (1 ? x)^2k+1Σ_n=0^∞f_k(n)xⁿ analogous to the well-known combinatorial interpretation of the Eulerian numbers in terms of descents of permutations.     

Nonexistence of Complete (st−t/s)-Arcs in Generalized Quadrangles of Order (s, t), I

Let $\text{S}$ be a finite generalized quadrangle (GQ) of order (s, t), s≠1≠t. A k-arc $\text{K}$ is a set of k mutually non-collinear points. For any k-arc of $\text{S}$ we have k⩽st+1; if k=st+1, then $\text{K}$ is an ovoid of $\text{S}$. A k-arc is complete if it is not contained in a k′-arc with k′>k. In S. E. Payne and J. A. Thas, Finite Generalized Quadrangles, Pitman, Boston, 1984, it is proved that an (st−m)-arc, where −1⩽m<t/s, is always contained in a uniquely defined ovoid, hence it is a natural question to ask whether or not complete (st−t/s)-arcs exist. In this note, we prove that the classical GQ H(4, q²) has no complete (q⁵−q)-arcs. We also show that a GQ $\text{S}$ of order s with a regular point has no complete (s²−1)-arcs, except when s=2, i.e. $\text{S}$≅$\text{Q}$(4, 2), and in that case there is a unique example. As a by-product there follows that no known GQ of even order s with s>2 can have complete (s²−1)-arcs. Also, we prove that a GQ of order (s, s²), s≠1, cannot have complete (s³−s)-arcs unless s=2, i.e., $\text{S}$≅$\text{Q}$(5, 2), in which case there is a unique example (up to isomorphism).     

A basis for S k (Γ 0(4)) and representations of integers as sums of squares

In this paper, we find a basis for the space S _k (?? ₀(4)) of cusp forms of even weight k for the congruence subgroup ?? ₀(4) in terms of Eisenstein series. As an application, we obtain formulas for r _4s (n), the number of ways to represent a nonnegative integer n as a sum of 4s integral squares.     

A note on the probabilistic approach to Turán's problem

The Turán number T(n, l, k) is the smallest possible number of edges in a k-graph on n vertices such that every l-set of vertices contains an edge. Given a k-graph H = (V(H), E(H)), we let X_s(S) equal the number of edges contained in S, for any s-set S?V(H). Turán's problem is equivalent to estimating the expectation E(X_l), given that min(X_l) ≥ 1. The following lower bound on the variance of X_s is proved:

$\text{Var(X}{}_{\mathrm{s}}\text{)?mm}\text{n?2k}\text{s?k}\text{n}\text{s}{}^{\mathrm{?1}}\text{n}\text{k}{}^1$

, where m = |E(H)| and $\text{m}\text{= (}{}_{\mathrm{k}}{}^{\mathrm{n}}\text{) ? m}$. This implies the following: putting t(k, l) = lim_n→∞T(n, l, k)(_kⁿ)^?1 then t(k, l) ≥ T(s, l, k)((_k^s) ? 1)^?1, whenever s ≥ l > k ≥ 2. A connection of these results with the existence of certain t-designs is mentioned.     

Vertex-, edge-, and total-colorings of Sierpiński-like graphs

Vertex-colorings, edge-colorings and total-colorings of the Sierpiński gasket graphs S_n, the Sierpiński graphs S(n,k), graphs S⁺(n,k), and graphs S⁺⁺(n,k) are considered. In particular, χ^″(S_n), χ^′(S(n,k)), χ(S⁺(n,k)), χ(S⁺⁺(n,k)), χ^′(S⁺(n,k)), and χ^′(S⁺⁺(n,k)) are determined.     

Reflexivity defect of spaces of linear operators

For a finite-dimensional linear subspace S⊆L(V,W) and a positive integer k, the k-reflexivity defect of S is defined by rd_k(S)=dim(Ref_k(S)/S), where Ref_k(S) is the k-reflexive closure of S. We study this quantity for two-dimensional spaces of operators and for single generated algebras and their commutants.     

Inventory models with minimal service level constraints

This paper investigates inventory models in which the stockout cost is replaced by a minimal service level constraint (SLC) that requires a certain level of service to be met in every period. The minimal service level approach has the virtue of simplifying the computation of an optimal ordering policy, because the optimal reorder level is solely determined by the minimal SLC and demand distributions. It is found that above a certain “critical” service level, the optimal (s,S) policy “collapses” to a simple base-stock or order-up-to level policy, which is independent on the cost parameters. This shows the minimal SLC models to be qualitatively different from their shortage cost counterparts. We also demonstrate that the “imputed shortage cost” transforming a minimal SLC model to a shortage cost model does not generally exist. The minimal SLC approach is extended to models with negligible set-up costs. The optimality of myopic base-stock policies is established under mild conditions.     

Sufficient conditions for restricted-edge-connectivity to be optimal

For a connected graph G=(V,E), an edge set S⊂E is a k-restricted-edge-cut if G-S is disconnected and every component of G-S has at least k vertices. The cardinality of a minimum k-restricted-edge-cut is the k-restricted-edge-connectivity of G, denoted by λ_k(G). In this paper, we study sufficient conditions for λ_k(G) to be optimal, especially when k=2 and 3.