Production scheduling with history‐dependent setup times

We consider a parallel‐machine scheduling problem with jobs that require setups. The duration of a setup does not depend only on the job just completed but on a number of preceding jobs. These setup times are referred to as history‐dependent. Such a scheduling problem is often encountered in the food processing industry as well as in other process industries. In our model, we consider two types of setup times—a regular setup time and a major setup time that becomes necessary after several “hard‐to‐clean” jobs have been processed on the same machine. We consider multiple objectives, including facility utilization, flexibility, number of major setups, and tardiness. We solve several special cases assuming predetermined job sequences and propose strongly polynomial time algorithms to determine the optimal timing of the major setups for given job sequences. We also extend our analysis to develop pseudopolynomial time algorithms for cases with additional objectives, including the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Capacity games for partially complementary products under multivariate random demands

In this study, we consider n firms, each of which produces and sells a different product. The n firms face a common demand stream which requests all their products as a complete set. In addition to the common demand stream, each firm also faces a dedicated demand stream which requires only its own product. The common and dedicated demands are uncertain and follow a general, joint, continuous distribution. Before the demands are realized, each firm needs to determine its capacity or production quantity to maximize its own expected profit. We formulate the problem as a noncooperative game. The sales price per unit for the common demand could be higher or lower than the unit price for the dedicated demand, which affects the firm's inventory rationing policy. Hence, the outcome of the game varies. All of the prices are first assumed to be exogenous. We characterize Nash equilibrium(s) of the game. At the end of the article, we also provide some results for the endogenous pricing. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 59: 146–159, 2012     

Priority queue with customer upgrades

This article is concerned with a general multi‐class multi‐server priority queueing system with customer priority upgrades. The queueing system has various applications in inventory control, call centers operations, and health care management. Through a novel design of Lyapunov functions, and using matrix‐analytic methods, sufficient conditions for the queueing system to be stable or instable are obtained. Bounds on the queue length process are obtained by a sample path method, with the help of an auxiliary queueing system. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Coordinated pricing and inventory control problems with capacity constraints and fixed ordering cost

This article addresses a single‐item, finite‐horizon, periodic‐review coordinated decision model on pricing and inventory control with capacity constraints and fixed ordering cost. Demands in different periods are random and independent of each other, and their distributions depend on the price in the current period. Each period's stochastic demand function is the additive demand model. Pricing and ordering decisions are made at the beginning of each period, and all shortages are backlogged. The objective is to find an optimal policy that maximizes the total expected discounted profit. We show that the profit‐to‐go function is strongly CK‐concave, and the optimal policy has an (s,S,P) ‐like structure. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Parametric inference for component distributions from lifetimes of systems with dependent components

In system reliability analysis, for an n ‐component system, the estimation of the performance of the components in the system is not straightforward in practice, especially when the components are dependent. Here, by assuming the n components in the system to be identically distributed with a common distribution belonging to a scale‐family and the dependence structure between the components being known, we discuss the estimation of the lifetime distributions of the components in the system based on the lifetimes of systems with the same structure. We develop a general framework for inference on the scale parameter of the component lifetime distribution. Specifically, the method of moments estimator (MME) and the maximum likelihood estimator (MLE) are derived for the scale parameter, and the conditions for the existence of the MLE are also discussed. The asymptotic confidence intervals for the scale parameter are also developed based on the MME and the MLE. General simulation procedures for the system lifetime under this model are described. Finally, some examples of two‐ and three‐component systems are presented to illustrate all the inferential procedures developed here. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

一类非线性反应扩散控制系统解的整体存在性

研究一类非线性反应扩散控制系统,采用对偶性技巧及Holder不等式方法,得到在Dirichlet边界条件下解的整体存在性.     

基于信息系统装备指挥运行机制构建研究

着眼装备指挥变革和提高指挥效能的需要,提出了基于信息系统装备指挥运行机制的概念,构建了基于信息系统的要素式装备指挥机构模型,明确了各指挥要素职能及其相互关系,分析了装备指挥信息、决策计划、协调控制的流程,建立了装备指挥效能计算模型,以期为建设新型科学的装备指挥运行机制提供依据．     

战场C4ISR中的体系成熟度生长模型

本文比较了体系和一般复杂巨系统概念之间的差异,提出了一个用来刻画和分析战场C4ISR领域体系的成熟度生长模型,指出一体化是体系生长过程达到的一种较高级的状态。并结合美军的区域防空体系发展,讨论了C4ISR中体系认知和研制中容易犯的错误,揭示其体系成长和发展规律,指出企图通过某个独立系统构建来操控一个体系,不符合体系发展规律,类似的努力也注定不会成功。     

Reliability of linear multistate multiple sliding window systems

This paper proposes a new model that generalizes the linear consecutive k‐out‐of‐r‐from‐n:F system to multistate case with multiple failure criteria. In this model (named linear multistate multiple sliding window system) the system consists of n linearly ordered multistate elements (MEs). Each ME can have different states: from complete failure up to perfect functioning. A performance rate is associated with each state. Several functions are defined for a set of integer numbers ρ in such a way that for each r ∈ ρ corresponding function f_r produces negative values if the combination of performance rates of r consecutive MEs corresponds to the unacceptable state of the system. The system fails if at least one of functions f_r for any r consecutive MEs for r ∈ ρ produces a negative value. An algorithm for system reliability evaluation is suggested which is based on an extended universal moment generating function. Examples of system reliability evaluation are presented. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Scheduling and lot streaming in two‐machine open shops with no‐wait in process

We study the problem of minimizing the makespan in no‐wait two‐machine open shops producing multiple products using lot streaming. In no‐wait open shop scheduling, sublot sizes are necessarily consistent; i.e., they remain the same over all machines. This intractable problem requires finding sublot sizes, a product sequence for each machine, and a machine sequence for each product. We develop a dynamic programming algorithm to generate all the dominant schedule profiles for each product that are required to formulate the open shop problem as a generalized traveling salesman problem. This problem is equivalent to a classical traveling salesman problem with a pseudopolynomial number of cities. We develop and test a computationally efficient heuristic for the open shop problem. Our results indicate that solutions can quickly be found for two machine open shops with up to 50 products. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005