Production and transport logistics scheduling with two transport mode choices

This paper considers a new class of scheduling problems arising in logistics systems in which two different transportation modes are available at the stage of product delivery. The mode with the shorter transportation time charges a higher cost. Each job ordered by the customer is first processed in the manufacturing facility and then transported to the customer. There is a due date for each job to arrive to the customer. Our approach integrates the machine scheduling problem in the manufacturing stage with the transportation mode selection problem in the delivery stage to achieve the global maximum benefit. In addition to studying the NP‐hard special case in which no tardy job is allowed, we consider in detail the problem when minimizing the sum of the total transportation cost and the total weighted tardiness cost is the objective. We provide a branch and bound algorithm with two different lower bounds. The effectiveness of the two lower bounds is discussed and compared. We also provide a mathematical model that is solvable by CPLEX. Computational results show that our branch and bound algorithm is more efficient than CPLEX. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Sojourn times in a two‐stage queueing network with blocking

The model considered in this paper involves a tandem queue consisting of a sequence of two waiting lines. The main feature of our model is blocking, i.e., as soon as the second waiting line reaches a certain upper limit, the first line is blocked. The input of units to the tandem queue is the MAP (Markovian arrival process), and service requirements are of phase type. Our objective is to study the sojourn time distribution under the first‐come‐first‐serve discipline by analyzing the sojourn time through times until absorption in appropriately defined quasi‐birth‐and‐death processes and continuous‐time Markov chains. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Economic ordering decisions with market choice flexibility

Standard approaches to classical inventory control problems treat satisfying a predefined demand level as a constraint. In many practical contexts, however, total demand is comprised of separate demands from different markets or customers. It is not always clear that constraining a producer to satisfy all markets is an optimal approach. Since the inventory‐related cost of an item depends on total demand volume, no clear method exists for determining a market's profitability a priori, based simply on per unit revenue and cost. Moreover, capacity constraints often limit a producer's ability to meet all demands. This paper presents models to address economic ordering decisions when a producer can choose whether to satisfy multiple markets. These models result in a set of nonlinear binary integer programming problems that, in the uncapacitated case, lend themselves to efficient solution due to their special structure. The capacitated versions can be cast as nonlinear knapsack problems, for which we propose a heuristic solution approach that is asymptotically optimal in the number of markets. The models generalize the classical EOQ and EPQ problems and lead to interesting optimization problems with intuitively appealing solution properties and interesting implications for inventory and pricing management. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

康特洛维奇的数值方法在矩形薄板横向弯曲振动中的应用

本文提出的解决矩形薄板弯曲振动问题的康特洛维奇的数值方法,大大减少了所需要的计算机内存。通过算例表明它具有比较高的计算精度和计算速度,是一种有前途的计算方法。     

Heart analytics: Analytical modeling of cardiovascular care

Cardiovascular diseases (CVDs) are the leading cause of death and disability both in the United States and worldwide. Despite high morbidity, mortality, and cost in the United States and global healthcare systems, cardiovascular care has been understudied in the healthcare operations management literature. In this paper, we identify research opportunities for healthcare operations management scholars to aid in improving cardiovascular care. We focus on three burdensome conditions, including (1) coronary artery disease, (2) stroke, and (3) heart failure, which, collectively, lead to the vast majority of CVD‐caused mortality and disability. For each condition, we characterize a typical patient's journey in receiving cardiovascular care, elucidating key challenges in improving care and outlining research questions for healthcare operations management scholars. We close with a reference to new research opportunities that emerge as artificial intelligence is likely to transform much of cardiovascular care.     

Fracture mechanism of a cylindrical shell cut by circumferential detonation collision

The failure mechanism of a cylindrical shell cut into fragments by circumferential detonation collision was experimentally and numerically investigated. A self-designed detonation wave regulator was used to control the detonation and cut the shell. It was found that the self-designed regulator controlled the fragment shape. The macrostructure and micro-characteristics of fragments revealed that shear fracture was a prior mechanism, the shell fractured not only at the position of detonation collision, but the crack also penetrated the shell at the first contact position of the Chapmen-Jouguet (C-J) wave. The effects of groove number and outer layer thickness on the fracture behavior were tested by simulations. When the thickness of the outer layer was 5–18 mm, it has little effect on fragmentation of the shell, and shells all fractured at similar positions. The increase of the groove number reduced the fracture possibility of the first contact position of the C-J wave. When the groove number reached 7 with a 10 mm outer layer (1/4 model), the fracture only occurred at the position of detonation collision and the fragment width rebounded.     

Stochastic analysis of a single server retrial queue with general retrial times

Retrial queueing systems are widely used in teletraffic theory and computer and communication networks. Although there has been a rapid growth in the literature on retrial queueing systems, the research on retrial queues with nonexponential retrial times is very limited. This paper is concerned with the analytical treatment of an M/G/1 retrial queue with general retrial times. Our queueing model is different from most single server retrial queueing models in several respectives. First, customers who find the server busy are queued in the orbit in accordance with an FCFS (first‐come‐first‐served) discipline and only the customer at the head of the queue is allowed for access to the server. Besides, a retrial time begins (if applicable) only when the server completes a service rather upon a service attempt failure. We carry out an extensive analysis of the queue, including a necessary and sufficient condition for the system to be stable, the steady state distribution of the server state and the orbit length, the waiting time distribution, the busy period, and other related quantities. Finally, we study the joint distribution of the server state and the orbit length in non‐stationary regime. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 561–581, 1999     

水面舰艇防空火力兼容问题

火力兼容是水面舰艇对空防御火力使用上的难点之一。在描述了舰艇防空火力兼容的五条使用原则的基础上,从时域和空域两个方面,通过对舰空导弹、中口径舰炮和小口径舰炮使用时机与安全爆炸时间之间的关系进行深入研究,从理论上分析了水面舰艇防空火力的兼容问题,建立了相应的数学模型,对于提高水面舰艇的防空作战效能具有实际应用价值。     

基于HLA/RTI的炮兵指挥系统仿真设计与开发

HLA高级体系结构作为新一代分布式仿真技术标准,解决了仿真系统中的可重用和互操作性问题,在C3I系统仿真领域有着十分广泛的应用。分析了C3I系统仿真的可行性和必要性,简要介绍了HLA高级体系结构的技术规范,提出了一种基于HLA/RTI的能与实践相接的、易于扩展的炮兵指挥系统仿真框架,并依据联邦开发与执行过程模型(FEDEP)给出了该系统的设计与开发过程。     

A stochastic machine maintenance and sale problem: Results with different production functions

In this article we solve and analyze a stochastic version of the Boiteux problem by employing the stochastic optimal control method. Our setup is close to that of Thompson [22]. Our focus is to analyze, under the same structure, how different production functions and how the variance in machine deterioration/maintenance affect our optimal machine maintenance and sale date decisions. © 1993 John Wiley & Sons, Inc.