Two‐agent scheduling on a single sequential and compatible batching machine

We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent seeks to optimize some scheduling criterion that depends on the completion times of its own jobs only. We consider several scheduling problems arising from different combinations of some regular scheduling criteria, including the maximum cost (embracing lateness and makespan as its special cases), the total completion time, and the (weighted) number of tardy jobs. Our goal is to find an optimal schedule that minimizes the objective value of one agent, subject to an upper bound on the objective value of the other agent. For each problem under consideration, we provide either a polynomial‐time or a pseudo‐polynomial‐time algorithm to solve it. We also devise a fully polynomial‐time approximation scheme when both agents’ scheduling criteria are the weighted number of tardy jobs.     

支持向量机规则提取

支持向量机是一种黑箱模型,其学习到的知识蕴含在决策函数中,不仅影响了用户对利用支持向量机技术构建智能系统的信心,还阻碍了支持向量机技术在数据挖掘领域的应用。由于对支持向量机规则提取进行研究有助于解决上述问题,因此该领域正成为机器学习和智能计算界的研究热点。分析了具有代表性的支持向量机规则提取算法,并提出该领域未来的研究重点。     

Scheduling jobs and maintenance activities on parallel machines

Most machine scheduling models assume that the machines are available all of the time. However, in most realistic situations, machines need to be maintained and hence may become unavailable during certain periods. In this paper, we study the problem of processing a set of n jobs on m parallel machines where each machine must be maintained once during the planning horizon. Our objective is to schedule jobs and maintenance activities so that the total weighted completion time of jobs is minimized. Two cases are studied in this paper. In the first case, there are sufficient resources so that different machines can be maintained simultaneously if necessary. In the second case, only one machine can be maintained at any given time. In this paper, we first show that, even when all jobs have the same weight, both cases of the problem are NP-hard. We then propose branch and bound algorithms based on the column generation approach for solving both cases of the problem. Our algorithms are capable of optimally solving medium sized problems within a reasonable computational time. We note that the general problem where at most j machines, 1 ≤ j ≤ m, can be maintained simultaneously, can be solved similarly by the column generation approach proposed in this paper. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 145–165, 2000     

风速传感器在风幕机改进中的应用研究

从节能降耗角度探讨了对风幕机进行改进的必要性 ,通过计算分析确定了风速为系统改进所要考虑的主要环境因素 ,研究了利用热电式风速传感器和变频器实现系统智能化改进的可行性。     

Data-driven research in retail operations—A review

We review the operations research/management science literature on data-driven methods in retail operations. This line of work has grown rapidly in recent years, thanks to the availability of high-quality data, improvements in computing hardware, and parallel developments in machine learning methodologies. We survey state-of-the-art studies in three core aspects of retail operations—assortment optimization, order fulfillment, and inventory management. We then conclude the paper by pointing out some interesting future research possibilities for our community.     

基于深度森林的网络流量分类方法

随着网络应用的迅猛发展,流量分类在网络资源分配、流量调度和网络安全等诸多研究领域受到广泛关注。现有的机器学习流量分类方法对流量数据特征的选取和分布要求苛刻,导致在实际应用中的复杂流量场景下分类精确度和稳定度难以提高。为了解决样本特征属性的复杂性给分类性能带来的不利影响,引入了基于深度森林的流量分类方法。该算法通过级联森林和多粒度扫描机制,能够在样本数量规模和特征属性选取规模有限的情况下,有效地提高流量整体分类性能。通过网络流量公开数据集Moore对支持向量机、随机森林和深度森林机器学习算法进行训练和测试,结果表明基于深度森林的网络流量分类器的分类准确率能够达到96. 36%,性能优于其他机器学习模型。     

挠性接管隔振效果检测试验装置合理性的讨论

采用机电比拟的方法对挠性接管隔振效果检测试验装置进行了分析,针对欲达到的试验目的,定性地提出了组成试验装置的质量、弹性常数等应达到的要求.     

一种数控火炮拉线机床的设计与实现

针对现行工厂使用的拉线机床操作不便、可视性差的弱点,提出一种采用单片机及光电编码技术对火炮加工中的膛线加工机床进行数字化控制的方案,使膛线加工精度、质量和效益均可得到提高,是实现各种复杂膛线加工的一种实用、可行的方法。     

基于支持向量机的多传感器空中目标识别研究

针对空中目标识别的复杂性,将支持向量机引入对空中目标的多传感器识别,对其机理进行了详细分析,建立了基于支持向量机的空中目标识别的算法模型.仿真实验的结果表明,该方法具有很好的识别效果,并且是一种能在训练样本很少的情况下达到很好分类推广能力的学习算法.     

一种对间歇采样转发干扰的识别新方法

间歇采样转发干扰是一种针对相干雷达的有效干扰样式,该类干扰的抑制技术研究需求迫切,而干扰识别历来是抗干扰流程中的关键环节,针对间歇采样转发干扰的识别问题,提出了一种基于关联维数的干扰识别方法。通过对3类间歇采样转发干扰信号进行傅里叶变换,挖掘信号频谱上的差异,提取频域关联维数作为干扰识别的特征参数,并利用支持向量机进行分类识别,为后续雷达系统采取针对性抗干扰措施提供重要的决策信息。仿真结果证明该方法具有较高的识别率。