基于传感器信息的机器人精密装配作业分析

介绍了一个应用力传感器组成的智能机器人精密装配作业的宏／微操作系统，它能够完成一般凸形销孔零件沿任意方向的精密装配作业。     

Response time variability

Response time variability is a new optimization problem with a broad range of applications and a distinctive number of theoretic flavour. The problem occurs whenever events, jobs, clients or products need to be sequenced so as to minimize the variability of time for which they wait for the next turn in obtaining the resources necessary for their advance. The problem has numerous real-life applications. We study its computational complexity, present efficiency, polynomial time algorithms for some cases, and the NP-hardness proof for a general problem. We propose a position exchange heuristic and apply it to improve the total response time variability of an initial sequence. The latter is the optimum bottleneck sequence, Webster or Jefferson sequence of the apportionment, or a random sequence. We report on computational experiments with the heuristic.     

A sequencing problem for a mixed-model assembly line in a JIT production system

In an assembly line of a just-in-time (JIT) production system, workers have the power and the responsibility to stop the line when they fail to complete their operations within their work zones. This paper deals with a sequencing problem for the mixed-model assembly conveyor line in the JIT production system. In some environment, the most important criterion is the line stoppage rather than the variation of production rates. The problem is to find an optimal sequence of units that minimizes the total line stoppage time. Lower and upper bounds of the total line stoppage time are derived and the branch-and-bound method is applied to the problem. A numerical example is given.