An autonomous decentralized scheduling algorithm for a scheduling problem in a metal mould assembly process

This paper deals with a scheduling problem in a metal mould assembly process. The process is of job shop type with several additional constraints. One constraint is that precedence relations exist not only among operations but also among jobs. The other constraint is that the system has two types of machines in parallel. The single-function machine executes a specific operation of each job and the multi-function machine can execute several operations. Therefore selection of the machine is necessary for executing each operation. In addition the problem has two objective functions. One is to minimize the sum of the tardiness of each job, and the other is to maximize the working time of the multi-function machine because of reducing the operating cost of machines. An autonomous decentralized scheduling algorithm is proposed to obatin a compromise solution of the multi-objective problem. In this algorithm, a number of decision makers are called subsystems, which co-operate with one another in order to attain the goal of the overall system. In our algorithm, all jobs and the set of multi-function machine are defined as the subsystem because their objective functions are competitive. They determine the scheduling plan on the basis of their co-operation and the satisfaction of their own objective function levels. The effectiveness of the algorithm is investigated by examining numerical results.     

Scheduling hard and soft real-time communication in a controller area network

The paper introduces a mechanism to implement distributed scheduling for the CAN-bus resource in order to meet the requirements of a dynamic distributed real-time system. The key issues considered here are multicasting, distinguishing between hard real-time, soft real-time, and non-real-time constraints, achieving high resource utilization for the CAN-bus, and supporting dynamic hard real-time computing by allowing dynamic reservation of communication resources.     

多进程动态调度方法

文章对相关进程的典型关系进行了描述,并讨论了进程中有序和同步问题的实现方法。     

DEVELOPMENT OF REGRESSION MODELS TO CONTROL PRODUCT YIELDS AND PROPERTIES OF THE FLUID CATALYTIC CRACKING PROCESS

Regression models for predicting product yields and properties for the Fluid Catalytic Cracking (FCC) process are presented. The feedstock properties are used as the primary correlation parameters. The models are based on data collected from various sources from the literature on pilot and commercial plants. The predictions of these models are compared to previous models and also to real data. The proposed models give consistently good predictions. These models can be used to evaluate different feeds to the FCC process and can also be integrated within general refinery mathematical programming (e.g. LP) software for planning and scheduling purposes.     

梯级水电系统组合优化调度方法研究

文章提出两种基于Ｌａｇｒａｎｇｅ松驰技术的梯级水电系统优化调度算法,能够综合处理离散运行区间,最小启停机时间等离散约束、水库间的水力耦合网络约束以及水头影响。基于实际系统数据的数值仿真,表明了该算法的有效性和实用性。     

基于AUML构建多Agent敏捷制造调度系统

AUML(Agent Unified Modeling Language)是一种FIPA(Foundation of Intelligent Physical Agents)和OMG(Object Management Group)都推荐使用的多Agent系统建模技术,本文尝试采用AUML技术来实现对多Agent敏捷制造调度系统的建模。通过扩展UML类图,描述了系统中Agent的结构和它们之间的关系。还采用了对UML的另一扩展:AUML协议图,来进一步详述了Agent之间的主要交互活动。     

基于非完美功率域非正交多址接入网络的上行链路低功耗研究

功率域非正交多址接入(PD-NOMA)技术可以有效提高无线网络频谱利用率,满足大规模节点接入及低时延等需求,但存在功耗大的缺点,在工业传感器网络中面临巨大挑战。对此,基于PD-NOMA的上行网络,接收机使用串行干扰抵消(SIC)迭代解码,在给定实时性需求下,通过用户调度和功率分配的联合优化,最小化网络的功耗。通过分析最优解存在的充分必要条件,提出功率阈值向量,将其转换成一个二部图最大匹配问题,用KM算法求得最优。仿真结果表明,时延性需求、残差和阈值对系统功耗有着较大影响。     

A new scheduling algorithm to provide proportional QoS in optical burst switching networks

A new scheduling algorithm, which aims to provide proportional and controllable QoS （Quality of Service） in terms of burst loss probability for OBS （Optical Burst Switching） networks, is proposed on the basis of a survey of QoS schemes in current OBS networks. With simulations, performance analysis and comparisons are carried out in detail. The results show that, in the proposed scheme, burst loss probabilities are proportional to the given factors and the control of QoS performance can be achieved with better performance. This scheme will be beneficial to the OBS network management and the tariffpolicy making.     

An improved heuristic to minimize total flow time for scheduling in the m-machine no-wait flow shop

In this paper, we present a constructive heuristic to minimize total flow time criterion for the well-known NP-hard no-wait flow shop scheduling problem. It is based on the assumption that the priority of a job in the initial sequence is given by the sum of its processing times on the bottleneck machines. The initial sequence of jobs thus generated is further improved using a new job insertion technique. We show, through computational experimentation, that the proposed method significantly outperforms the best-known heuristics while retaining its time complexity of O(n²). Statistical tests of significance are used to confirm the improvement in solution quality.     

A sequential cooperative game theoretic approach to scheduling multiple large-scale applications in grids

Scheduling large-scale applications in heterogeneous distributed computing systems is a fundamental NP-complete problem that is critical to obtaining good performance and execution cost. In this paper, we address the scheduling problem of an important class of large-scale Grid applications inspired by the real world, characterized by a huge number of homogeneous, concurrent, and computationally intensive tasks that are the main sources of performance, cost, and storage bottlenecks. We propose a new formulation of this problem based on a cooperative distributed game-theory-based method applied using three algorithms with low time complexity for optimizing three important metrics in scientific computing: execution time, economic cost, and storage requirements. We present comprehensive experiments using simulation and real-world applications that demonstrate the effectiveness of our approach in terms of time and fairness compared to other related algorithms.