Bicriteria scheduling of a material handling robot in an m-machine cell to minimize the energy consumption of the robot and the cycle time

This study considers a flowshop type production system consisting of m machines. A material handling robot transports the parts between the machines and loads and unloads the machines. We consider the sequencing of the robot moves and determining the speeds of these moves simultaneously. These decisions affect both the robot’s energy consumption and the production speed of the system. In this study, these two objectives are considered simultaneously. We propose a second order cone programming formulation to find Pareto efficient solutions. We also develop a heuristic algorithm that finds a set of approximate Pareto efficient solutions. The conic formulation can find robot schedules for small cells with less number of machines in reasonable computation times. Our heuristic algorithm can generate a large set of approximate Pareto efficient solutions in a very short computational time. Proposed solution approaches help the decision-maker to achieve the best trade-off between the throughput of a cell and the energy efficiency of a material handling robot.     

可变频变压器的建模仿真与分析

采用高压直流输电方式连接两个异步电网存在谐波干扰、换相失败、难以实现功率平滑调节、无功功率不能随有功功率传输等问题。文章介绍了可变频变压器的的基本结构及原理,研究了可变频变压器的数学模型及控制模型,给出了可变频变压器传输功率与直流驱动电动机提供的驱动转矩之间的数学关系式,在此基础上采用PSCAD软件搭建了可变频变压器模型并进行了仿真研究。仿真结果表明,可变频变压器可以实现两个异步电网之间的连接并进行功率双向平滑传输,响应速度快;通过转速控制器控制直流驱动电动机的转速可使旋转变压器的转速恒定,以弥补两个电网的频差,维持系统平衡。     

成像卫星星地联合成像调度

成像卫星星地联合调度问题,涉及调度对象众多,约束条件复杂,需要考虑任务的观测、回传2个过程,是一个具有两层时间窗口约束的双层优化问题,统一建模困难。根据问题的特点,采用基于阶段优化的方式,降低了问题的复杂性。把问题分为观测调度阶段和数据回传调度阶段,分别给出了优化目标和约束条件,建立了基于阶段优化的成像卫星星地联合调度模型,实现了从任务观测到数据回传的全过程调度。仿真实例表明,该方法能够有效解决多星多站的协同任务调度问题。     

FMS的模型参考自适应调度

用运筹学研究生产线调度问题已有几十年的历史,但由此得出的调度策略的实时性很差.1986年自动控制工作者提出了“PMS动态自适应计算机调”一词.令人感到十分新奇.可惜.从未见到任何有关的论文.本文研究FMS的模型参考自适应调度.本文采用我们提出的考虑了有限缓冲器容量的极大代数模型.环境的影响反映于对象参数的摄动,本文采用我们提出的摄动计算方法.调度器的设计采用次梯度法,以求解连续变量和离散变量混合的优化问题,附有数字实例,计算和仿真表明:FMS的模型参考自适应调度是可行的,是值得继续深入研究的。     

Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time

This paper extends the algorithms which were developed in Part I to cases in which there is no affine schedule, i.e. to problems whose parallel complexity is polynomial but not linear. The natural generalization is to multidimensional schedules with lexicographic ordering as temporal succession. Multidimensional affine schedules, are, in a sense, equivalent to polynomial schedules, and are much easier to handle automatically. Furthermore, there is a strong connection between multidimensional schedules and loop nests, which allows one to prove that a static control program always has a multidimensional schedule. Roughly, a larger dimension indicates less parallelism. In the algorithm which is presented here, this dimension is computed dynamically, and is just sufficient for scheduling the source program. The algorithm lends itself to a divide and conquer strategy. The paper gives some experimental evidence for the applicability, performances and limitations of the algorithm.     

基于虚拟仪器的汽车变速器计算机测控系统的设计

本文介绍了汽车自动变速器检测实验台的测控系统硬件组成,并采用Labview开发出测控系统的软件。可对汽车自动变速器综合性能与液压控制阀体进行测试操作和性能分析,实现检测对象测控的自动化。     

实验室排课系统开发与使用

实验室是学生实践实验的必要场所,但是所有高校都会面临着实验室少,学生人数多,如何更好分配实验室的使用,是实验室管理人员值得考虑的首要问题。针对此问题,本院校实验室结合自己实验室的真实情况编写实验室排课系统。     

栅栏覆盖最大化生存周期调度算法

栅栏覆盖是近年来无线传感器网络的研究热点之一,如何延长生存周期是无线传感器网络研究的一个重要问题。针对无线传感器网络的栅栏覆盖应用,设计了两种最大化网络生存周期的调度算法:集中式的Greedy调度算法和分布式的DBCS调度算法。仿真实验表明:两种算法显著地延长了网络的生存周期;在较稀疏的网络中,DBCS算法与Greedy算法性能接近,分布式的DBCS算法适合应用于大规模传感器网络。     

基于Visual Basic 开发机床主传动非常规变速系统的设计--重复转速的传动系统(实例之二)

本文介绍利用Visual Basic工具开发金属切削机床主传动非常规变速系统的设计总体结构，功能和方法，以重复转速的传动系统为例，重点介绍转速图的拟定过程，本系统具有界面美观，操作方便，易于理解的特点。     

Single-machine parallel-batching scheduling with family jobs to minimize weighted number of tardy jobs

We consider the problem of scheduling n jobs in batches on a single parallel-batching machine, where the jobs are partitioned into jobs families and the jobs in each family have the same due date. The objective is to minimize the weighted number of tardy jobs. We first devise an efficient pseudo-polynomial time and a fully polynomial time approximation scheme for the weighted problem. Then we present $O(n^2)$-time and $O(n\log n)$-time algorithms for the case where the jobs have the same weight and for the case where the jobs have the same processing time, respectively.