Exact algorithms for scheduling multiple families of jobs on parallel machines

In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003.     

超精密加工机床及其新技术发展

介绍了超精密加工技术、应用背景、发展动向以及超精密加工关键技术的一些最新成果。从超精密加工技术推广应用的角度阐述了其精度目标、模块化、廉价化发展趋势 ,同时就如何发展超精密加工技术全面介绍了目前机床模块化部件、传动系统、检测环节、数控系统和环境控制等领域的最新研究水平和成果。     

遥感数据处理任务调度的Petri网模型及求解算法

为了对多源遥感数据的处理任务进行有效的调度和管理,提高处理资源的利用率,根据遥感数据处理任务调度问题的特点,采用Petri网对该问题进行形式化描述,建立了遥感数据处理任务调度的数学模型,根据该问题的多目标特性,采用蚁群算法进行求解.给出仿真实例,将蚁群算法的求解结果与启发式算法和模拟退火算法的求解结果进行比较,验证算法...     

Multi‐period maintenance scheduling of tree networks with minimum flow disruption

We introduce a multi‐period tree network maintenance scheduling model and investigate the effect of maintenance capacity restrictions on traffic/information flow interruptions. Network maintenance refers to activities that are performed to keep a network operational. For linear networks with uniform flow between every pair of nodes, we devise a polynomial‐time combinatorial algorithm that minimizes flow disruption. The spiral structure of the optimal maintenance schedule sheds insights into general network maintenance scheduling. The maintenance problem on linear networks with a general flow structure is strongly NP‐hard. We formulate this problem as a linear integer program, derive strong valid inequalities, and conduct a polyhedral study of the formulation. Polyhedral analysis shows that the relaxation of our linear network formulation is tight when capacities and flows are uniform. The linear network formulation is then extended to an integer program for solving the tree network maintenance scheduling problem. Preliminary computations indicate that the strengthened formulations can solve reasonably sized problems on tree networks and that the intuitions gained from the uniform flow case continue to hold in general settings. Finally, we extend the approach to directed networks and to maintenance of network nodes. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Cyclic scheduling in robotic flowshops with bounded work‐in‐process levels

This study addresses cyclic scheduling in robotic flowshops with bounded work‐in‐process (WIP) levels. The objective is to minimize the cycle time or, equivalently, to maximize the throughput, under the condition that the WIP level is bounded from above by a given integer number. We present several strongly polynomial algorithms for the 2‐cyclic robotic flowshop scheduling problems for various WIP levels. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 1–16, 2011     

科学工作流技术研究综述

科学工作流管理系统(Scientific Workflow Management Systems,SWfMS)为科学家提供一个管理大规模复杂科学计算的有效平台,通过管理复杂应用程序对海量科学数据进行管理、分析、仿真和可视化以帮助科学家进行科学发现.本文首先对科学工作流(Scientific Workflow,SWF)...     

基于小波变换和支持向量机的水下目标分类方法

水下目标识别技术是世界各国十分重视的研究课题之一,具有重要的理论和应用价值。简要介绍了小波变换、多分辨率分析及支持向量机的基本原理,针对舰船辐射噪声信号,利用小波变换来完成信号的预处理和滤波,在小波变换后信号的多尺度子空间上提取信号的能量特征参数,归一化处理后构建特征向量,最后用支持向量机算法进行分类。仿真结果表明,利用小波变换的多分辨率分析和支持向量机能对舰船辐射噪声信号进行有效分类识别。     

基于粗糙集支持向量机的空袭目标识别

为提高对空袭目标的识别能力,提出了一种基于粗糙集支持向量机的空袭目标识别方法.该模型用RS方法构建SVM数据处理系统的前置系统,充分利用RS理论在处理大数据量,消除冗余信息等方面的优势,减少了SVM训练数据,克服了SVM算法因为数据量太大而导致处理速度慢的缺点.根据分类识别的要求,在RS-SVM两类分类算法的基础上,建...     

邻近支持向量机的阵列波束优化

针对标准支持向量回归波束形成器的计算复杂度高、内存开销大、训练速度慢的缺点,提出了邻近支持向量机(Proximal Support Vector Machine,PSVM)波束优化方法。PSVM打破了通过对偶问题求解原问题的传统思维,将支持向量回归的约束条件等式化,直接对原问题进行分析与求解,给出了基于PSVM波束形成器的优化模型及具体实现过程,并进行了数值仿真实验。研究结果表明,在保持波束形成器性能基本不变的情况下,降低了计算复杂度,减少了内存开销,提高了训练速度。与传统的支持向量回归波束形成相比,具有良好的快速性,为波束形成器的优化设计提供了一种新的有效方法。     

面向像斑的高分辨率遥感影像自优化迭代分类方法

针对高分辨率遥感影像提出了一种面向像斑的自优化迭代分类算法,基于半监督聚类算法获取训练样本,以支持向量机为核心设计了自优化迭代分类器。使用分型网络演化算法获取像斑,并从中选取少量标记样本;结合标记样本,利用半监督模糊C均值算法对像斑进行聚类,并基于密集度筛选得到训练样本;设计了自优化迭代支持向量机分类算法,对所有像斑进行迭代分类直到满足分类要求,并在分类过程中对近邻分类结果进行统计得到高可信度样本以自主优化训练样本集。基于以上方法分别对武汉市QuickBird和WorldView影像进行分类实验,分类总精度分别达到94.67%与92%,与基于人工选取训练样本情况下进行分类的分类总精度（82%与82.67%）、常规支持向量机分类总精度（87.33%与88%）、最小二乘支持向量机分类总精度（88%与89.33%）相比,精度有明显提升,分类效果较好。