Location and calculation-free node-scheduling schemes in large wireless sensor networks

In wireless sensor networks that consist of a large number of low-power, short-lived, unreliable sensors, one of the main design challenges is to obtain long system lifetime without sacrificing system original performance (sensing coverage and sensing reliability). To solve this problem, one of the potential approaches is to identify redundant nodes at the sensing interface and then assign them an off-duty operation mode that has lower energy consumption than the normal on-duty mode. In our previous work [J. Wireless Commun. Mobile Comput. 3 (2003) 271; Processing of ACM Wireless Sensor Network and Application Workshop 2002, September 2002], we proposed a node-scheduling scheme, which can provide a 100% sensing coverage preservation capability. This, however, requires each node to be aware of its own and its neighbors’ location information. Also, in that scheme, each node has to do accurate geometrical calculation to determine whether to take an off-duty status. In this paper, we propose and study several alternative node-scheduling schemes, which cannot completely preserve the original system coverage, but are nonetheless light-weighted and flexible compared with the previous one. Our simulation results compare these schemes with the previous one and demonstrate their effectiveness.     

CAM中一类新的NP完全问题

本文提出了计算机辅助制造(CAM)中的一类作业调度问题并证明了它的NP完全性。     

Scheduling in or-parallel Prolog systems: Survey and open problems

Implementation of or-parallel Prolog systems offers a number of interesting scheduling problems. The main issues are the interaction between memory models and scheduling, ordering of multiple solutions, and scheduling of speculative work. The problems occur partly because of the design choices (e.g. the choice of a memory model), and partly because of the desire to maintain observational equivalence between parallel and sequential implementations of Prolog, while achieving high efficiency. In the first part of this paper a common framework for discussing scheduling in or-parallel systems is introduced, and also a collection of issues that must be addressed in such systems is presented. In the second part of the paper we survey a number of solutions to these problems comparing their efficiency whenever possible. We close the survey with a short discussion of open problems.Current association: Carlstedt Elektronik AB     

Parallelization of WHILE loops on pipelined architectures

Modulo scheduling theory can be applied successfully to overlap Fortran DO loops on pipelined computers issuing multiple operations per cycle both with and without special loop architectural support. This paper shows that a broader class of loops—REPEAT-UNTIL, WHILE, and loops with more than one exit, in which the trip count is not known beforehand—can also be overlapped efficiently on multiple-issue pipelined machines. The approach is described with respect to a specific machine model, but it can be extended to other models. Special features in the architecture, as well as compiler representations for accelerating these loop constructs, are discussed. Performance results are presented for a few select examples.An earlier version of this paper was presented at Supercomputing '90.     

基于CORBA和多Agent的模具敏捷制造的工作流管理

介绍了CORBA的工作原理，分析了模具敏捷制造的特点，提出了基于CORBA的模具敏捷制造工作流管理模型，并且将多Agent技术应用到该模型之中，使其具有清晰的结构，良好的开放性、集成性和自适应性。     

一个改进的单抓钩周期性排序模型及其在自动化学处理线中的应用

计算机控制的抓钩广泛用于自动化学处理线的工件的运送。抓钩的排序直接影响系统的生产率，抓钩排序的目标是对运送进行排序以极大化生产率。当某工序处理时间非常长时，该工序成为瓶颈。为了去除该瓶颈，系统可以为该工序设计多个处理槽，这称为“多重处理槽”问题。本文提出一个改进的混合整数规划模型以求解有“多重处理槽”的单抓钩周期性排序问题的最优解。实例表明所提出的方法是有效的。     

Real-world extensions to scheduling algorithms based on lagrangian relaxation

Recently, efficient scheduling algorithms based on Lagrangian relaxation have been proposed for scheduling parallel machine systems and job shops. In this article, we develop real-world extensions to these scheduling methods. In the first part of the paper, we consider the problem of scheduling single operation jobs on parallel identical machines and extend the methodology to handle multiple classes of jobs, taking into account setup times and setup costs. The proposed methodology uses Lagrangian relaxation and simulated annealing in a hybrid framework. In the second part of the paper, we consider a Lagrangian relaxation based method for scheduling job shops and extend it to obtain a scheduling methodology for a real-world flexible manufacturing system with centralized material handling. This research was supported in part by the Office of Naval Research and the Department of Science and Technology grant N00014-93-1017.     

Hierarchical production control for a flow shop with dynamic setup changes and random machine breakdowns

In this paper, we study a manufacturing system consisting of two machines separated by two intermediate buffers, and capable of producing two different products. Each product requires a constant processing time on each of the machines. Each machine requires a constant non-negligible setup change time from one product to the other. The demand rate for each product is considered to be piecewise constant. Each machine undergoes failure and repair. The time-to-failure and time-to-repair are exponentially distributed random variables. The setup change and processing operations are resumable. We model our system as a continuous time, continuous flow process. An optimal control problem is formulated for the system to minimize the total expected discounted cost over an infinite horizon. To determine the optimal control policy structure, a discrete version of the problem is solved numerically using a dynamic programming formulation with a piecewise linear penalty function. A real-time control algorithm is then developed with the objective of maintaining low work-in-process inventory and keeping the production close to the demand. The algorithm uses a hierarchical control structure to generate the loading times for each product on each machine in real time and to respond to random disruptions in the system. The system is simulated using this algorithm to study its performance. The performance of the algorithm is also compared to alternative policies.     

柔性制造系统生产中的零件分批算法

根据ＦＭＳ资源、加工任务、零件工艺提出了零件分批算法，该算法在零件交货期的束下，以机床负荷平衡为目标，搜索零件集合，找出最合适的零件组合形成零件加工批。此算法为简化ＦＭＳ的动态调度和提高系统生产率创造了条件。仿真结果表明分批算法是行之有效的。     

Multi-plant production scheduling in SMEs

Traditionally, companies used to view themselves as separate entities and did not devote efforts to collaborate with other echelons of the extended enterprise. This even happened at multi-site companies owning different plants that belonged to the same supply chain. However, manufacturing facilities of the same supply chain should intensively share information and coordinate planning and scheduling tasks in order to get a globally optimized solution. This paper discusses some specific characteristics of the planning and scheduling problem in the extended enterprise including an analysis of a case study, and reviews the available state-of-the-art research studies in this field. Most studies suggest that integrated approaches can have a significant impact on the system performance, in terms of lower production costs, and less inventory levels. The paper provides some conclusions and suggestions of future works.