Energy‐efficient scheduling for sustainable manufacturing systems with renewable energy resources

Environmentally friendly energy resources open a new opportunity to tackle the problem of energy security and climate change arising from wide use of fossil fuels. This paper focuses on optimizing the allocation of the energy generated by the renewable energy system to minimize the total electricity cost for sustainable manufacturing systems under time‐of‐use tariff by clipping the peak demand. A rolling horizon approach is adopted to handle the uncertainty caused by the weather change. A nonlinear mathematical programming model is established for each decision epoch based on the predicted energy generation and the probability distribution of power demand in the manufacturing plant. The objective function of the model is shown to be convex, Lipchitz‐continuous, and subdifferentiable. A generalized benders decomposition method based on the primal‐dual subgradient descent algorithm is proposed to solve the model. A series of numerical experiments is conducted to show the effectiveness of the solution approach and the significant benefits of using the renewable energy resources.     

应用马尔科夫链的空中战役过程数学概念模型

空中战役过程的数学概念模型是对实际作战过程的抽象,是仿真建模的基础.在对空中战役过程物理特性分析基础上,根据典型化、模块化等手段对空中战役的典型作战过程进行处理,使其符合马尔科夫链的判别条件,将整个作战过程看作多个作战阶段组成的状态转移体系,建立用马尔科夫链描述的空中战役典型作战过程数学概念模型,探讨了作战阶段持续时间、状态转移概率的确定和其他影响因素,并对适合作战阶段数学模型的建模方法进行介绍.所得研究结果可以为仿真建模人员的仿真建模工作提供有益的指导.     

基于数据链的组合导航技术研究

打击精度已经成为远程制导武器系统最重要的技术指标,提出了一种可以替代卫星导航的数据链导航系统,对该系统的原理、实现、抗干扰、扰侦听进行了详细介绍,分析比较了该系统与惯导和卫星导航系统的误差.最后,得出了数据链导航系统在武器装备精确制导中具有优势的结论.     

Threshold incentives over multiple periods and the sales hockey stick phenomenon

In this article, we study threshold‐based sales‐force incentives and their impact on a dealer's optimal effort. A phenomenon, observed in practice, is that the dealer exerts a large effort toward the end of the incentive period to boost sales and reach the threshold to make additional profits. In the literature, the resulting last‐period sales spike is sometimes called the hockey stick phenomenon (HSP). In this article, we show that the manufacturer's choice of the incentive parameters and the underlying demand uncertainty affect the dealer's optimal effort choice. This results in the sales HSP over multiple time periods even when there is a cost associated with waiting. We then show that, by linking the threshold to a correlated market signal, the HSP can be regulated. We also characterize the variance of the total sales across all the periods and demonstrate conditions under the sales variance can be reduced. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

航天装备大数据资源平台构建技术研究

航天装备研制涉及论证、研制、生产、试验、综合保障等各个环节,所产生的数据具有种类多、数据量大、异构性强等特点,且数据资源分散于各科研机构院所,形成一个个数据孤岛,严重制约了型号数据的统一管理和协同应用。为了建立“逻辑统一、物理分散”的航天装备统一大数据中心,本文提出一种航天装备大数据资源平台构建技术,该平台基于统一的数据编目规范,综合利用云计算、微服务、区块链等技术,可实现多维异构数据深度融合管控,实现基于型号科研生产活动下的数据逻辑统一管理和实体分布式存储,能够解决航天装备整个研制活动全要素全过程的数据采集和可控共享的现实需求,为各业务场景下的数据分析奠定基础。     

严寒地区消防给水存在的问题及对策

分析了我国北方寒冷地区城市市政消防给水和室外消火栓系统在实际应用中出现的问题,并结合规范与寒冷地区实际情况和历年的经验,提出了解决办法。     

A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem

The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Batch scheduling on a two‐machine jobshop with machine‐dependent setup times

The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs (m ≥ 3) is known to be strongly NP‐hard even with no setup times. We focus in this article on the two‐machine case. We assume UET jobs and consider batching with batch availability and machine‐dependent setup times. We introduce an efficient \begin{align*}(O(\sqrt{n}))\end{align*} algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Benders' cuts guided large neighborhood search for the traveling umpire problem

This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Performance analysis of queue length monitoring of M/G/1 systems

This study investigates the statistical process control application for monitoring queue length data in M/G/1 systems. Specifically, we studied the average run length (ARL) characteristics of two different control charts for detecting changes in system utilization. First, the nL chart monitors the sums of successive queue length samples by subgrouping individual observations with sample size n. Next is the individual chart with a warning zone whose control scheme is specified by two pairs of parameters, (upper control limit, d_u) and (lower control limit, d_l), as proposed by Bhat and Rao (Oper Res 20 (1972) 955–966). We will present approaches to calculate ARL for the two types of control charts using the Markov chain formulation and also investigate the effects of parameters of the control charts to provide useful design guidelines for better performance. Extensive numerical results are included for illustration. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011