On the design of a tandem queue with blocking: Modeling,analysis, and gradient estimation

We demonstrate here how recent advances in the study of discrete-event stochastic systems provide fruitful results for the modeling, analysis, and design of manufacturing systems. We consider a multistage make-to-stock system where outputs from the final stage are used to satisfy customer demands. We address the problem of finding the appropriate trade-off between reduced order waiting time and increased process speeds. Using the idea of infinitesimal perturbation analysis (IPA), we establish a simple procedure where sample-path derivatives can be obtained along an arbitrary sample path. Under suitable conditions, we demonstrate that these derivative estimators are unbiased and strongly consistent and can be used in a classical stochastic optimization scheme to solve the problem. The role of continuity and convexity on the validity of the estimator is also addressed. Although the focus of this article is not to solve for the optimal solution, we provide a theoretical justification for such a pursuit. The approach is appealing as it is numerically stable, easy to implement, and can be extended to other system performance measures. © 1994 John Wiley & Sons, Inc.     

班组遥控武器站模糊自适应滑模位置控制器设计

针对班组遥控武器站位置伺服系统发射冲击力矩大、负载变化范围广和伺服精度要求高等特点,提出了一种模糊调节的位置伺服系统滑模控制策略。该策略选用了一种新型的带有积分的滑模面,模糊调节部分采用单输入双输出的结构,应用模糊规则调节新型快速终端滑模型趋近速率来削弱滑模抖振。分别进行了常值负载干扰、系统参数摄动、时变负载干扰和跟踪误差仿真实验。仿真实验表明,该控制策略的稳定性和伺服跟踪性很好,对参数摄动和负载干扰的鲁棒性很强。     

Server scheduling on parallel dedicated machines with fixed job sequences

We consider server scheduling on parallel dedicated machines to minimize the makespan. Each job has a loading operation and a processing operation. The loading operation requires a server that serves all the jobs. Each machine has a given set of jobs to process, and the processing sequence is known and fixed. We design a polynomial‐time algorithm to solve the two‐machine case of the problem. When the number of machines is arbitrary, the problem becomes strongly NP‐hard even if all the jobs have the same processing length or all the loading operations require a unit time. We design two heuristic algorithms to treat the case where all the loading times are unit and analyze their performance.     

CON/SLK due date assignment and scheduling on a single machine with two agents

We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A‐jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo‐polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial‐time approximation scheme. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 416–429, 2016     

浅谈《孙子兵法》与竞争智慧

孙子有备无患的军事思想,早已成为现代竞争领域的指导原则之一。每个人都有非常强烈的成功欲望,这样的人生,是一个永不停息的决策过程。从事什么样的工作,怎样做才能使自己在竞争中立于不败之地。《孙子兵法》告诉我们：人生竞争有策略。     

我国企业发展商务应树立“商务为本”的理念

本文主要阐述了发展电子商务过程中应建立“商务为本”的理念及“商务为本”的理念的含义。     

我国光电火控系统亟待解决的问题

介绍了光电跟踪器的优点 ,分析了我国目前光电跟踪器的现状 ,从装备发展的角度指出了光电跟踪器及光电火控系统亟待解决的科研课题     

Scheduling jobs with piecewise linear decreasing processing times

We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003     

战区弹药保障敏捷供应链优化模型及实现算法

针对现有的供需矛盾,在分析战区弹药保障供应链管理任务需求的基础上,初步构建了战区弹药保障敏捷供应链管理框架及运行机制,分析了战区弹药保障敏捷供应链的供需协同机制,重点对多级库存优化控制模型、多级弹药配送决策优化模型及实现算法进行了研究,提出了战区弹药保障敏捷供应链建设的具体对策。     

机载导弹惯导系统传递对准机动方式研究

研究了机动方式对机载导弹捷联惯导系统的传递对准时间和对准精度影响,通过理论分析和仿真计算的方法,比较了不同机动方式对传递对准效果的综合影响,分析了采用匀速直线飞行中一定范围的滚转幅值和平均滚转角速度的最优机动方式,可提高传递对准效率,为工程应用提供理论依据.