Minimax optimal control of uncertain systems with structured uncertainty

This paper considers a minimax control problem for an uncertain system containing structured uncertainties. The uncertainties in this system are assumed to satisfy a certain integral quadratic constraint. For a given initial condition, the minimax optimal controller is constructed by solving a parameter-dependent Riccati equation of the game type. This controller leads to a closed-loop uncertain system which is absolutely stable.     

柔性工时约束下项目调度及其蚁群算法

针对软件工程项目调度问题,在考虑加班工时的情况下,提出了柔性工时约束下项目调度问题的数学模型,并设计了相应的蚁群算法。模型对项目人力资源的特殊性进行了分析,指出项目人力资源是一种特殊的可更新资源,在允许加班的情况下,人力资源构成特殊的柔性工时约束。针对所设计的数学模型,在并行项目进度生成机制基础上设计了蚁群算法,并通过算例进行验证与分析。     

A novel knowledge-guided evolutionary scheduling strategy for energy-efficient connected coverage optimization in WSNs

One of the most important challenges in designing wireless sensor network is how to construct full-connected network containing least active sensor nodes with satisfied quality of services, such as the coverage rate and energy consumption. This energy-efficiency full-connected coverage optimization problem is modeled as a single-objective optimization problem with constraint. To solve this problem, a knowledge-guided evolutionary scheduling strategy is proposed. Three highlights of this strategy are: (1) Knowledge is defined as the importance of sensor node, which depends on the distance between sensor node and sink node. (2) The genes of an individual correspond to senor nodes in descending order of their importance. (3) Considering sensor nodes’ importance and redundancy rate, knowledge-guided mutation operator and repair strategy are present. Simulation results show that the proposed method can find the optimal full-connected wireless sensor network containing least sensor nodes and consuming less energy for communication by less computation time. Though the coverage rate of the optimum is larger, it still satisfies the coverage constraint. Moreover, this strategy fits for the problems that the communication radius of sensor node is less than two times of its sensing radius.     

A multi-objective reinforcement learning algorithm for deadline constrained scientific workflow scheduling in clouds

Recently, a growing number of scientific applications have been migrated into the cloud. To deal with the problems brought by clouds, more and more researchers start to consider multiple optimization goals in workflow scheduling. However, the previous works ignore some details, which are challenging but essential. Most existing multi-objective workflow scheduling algorithms overlook weight selection, which may result in the quality degradation of solutions. Besides, we find that the famous partial critical path (PCP) strategy, which has been widely used to meet the deadline constraint, can not accurately reflect the situation of each time step. Workflow scheduling is an NP-hard problem, so self-optimizing algorithms are more suitable to solve it.In this paper, the aim is to solve a workflow scheduling problem with a deadline constraint. We design a deadline constrained scientific workflow scheduling algorithm based on multi-objective reinforcement learning (RL) called DCMORL. DCMORL uses the Chebyshev scalarization function to scalarize its Q-values. This method is good at choosing weights for objectives. We propose an improved version of the PCP strategy calledMPCP. The sub-deadlines in MPCP regularly update during the scheduling phase, so they can accurately reflect the situation of each time step. The optimization objectives in this paper include minimizing the execution cost and energy consumption within a given deadline. Finally, we use four scientific workflows to compare DCMORL and several representative scheduling algorithms. The results indicate that DCMORL outperforms the above algorithms. As far as we know, it is the first time to apply RL to a deadline constrained workflow scheduling problem.     

Dynamic sensor transmission power scheduling for remote state estimation

In this paper, we consider the problem of sensor transmission power scheduling for remote state estimation. We assume that the sensor has two transmission energy levels, where the high level corresponds to a high packet reception ratio. By exploiting the feedback information from the remote estimator, we aim to find an optimal transmission power schedule. We formulate the problem as a Markov decision process, and analytically develop a simple and optimal dynamic schedule which minimizes the average estimation error under the energy constraint. Furthermore, we derive the necessary and sufficient condition under which the remote state estimator is stable. It is shown that the estimation stability only depends on the high-energy packet reception ratio and the spectral radius of the system dynamic matrix.     

基于约束的调度研究和实现

运用约束程序设计(CP)思想和技术来调度正成为一个新兴的研究领域。文章首先对CP和调度的相关领域知识进行了简要介绍;然后按照CP所倡导的问题建模和问题求解相分离的思想,建立起一般理论调度问题的约束模型,并设计实现了一个基于约束的调度求解算法CBS-1;并对一些典型问题进行了实验,实验结果表明算法提高了约束调度求解的效率和通用性。     

工序间存在零等待约束的复杂产品调度研究

针对实际装配生产中工序之间存在零等待约束的复杂产品的调度问题, 提出了一种把存在零等待约束的工序虚拟成一个工序的方法. 该方法在提出复杂产品、标准工序、虚拟工序、零等待和扩展加工工艺树的概念基础上, 对扩展加工工艺树中的标准工序采用拟关键路径法和最佳适应调度的车间调度算法进行调度, 对虚拟工序采用移动交换算法在相应设备上分离调度, 将存在零等待约束的调度问题转化为存在虚拟工序的无零等待约束的调度问题. 实例表明, 所提出的调度算法能够较好地解决具有实际意义的工序间存在零等待约束的复杂产品的调度问题, 且易于实现.     

Sensor data scheduling for optimal state estimation with communication energy constraint

In this paper, we consider sensor data scheduling with communication energy constraint. A sensor has to decide whether to send its data to a remote estimator or not due to the limited available communication energy. We construct effective sensor data scheduling schemes that minimize the estimation error and satisfy the energy constraint. Two scenarios are studied: the sensor has sufficient computation capability and the sensor has limited computation capability. For the first scenario, we are able to construct the optimal scheduling scheme. For the second scenario, we are able to provide lower and upper bounds of the minimum error and construct a scheduling scheme whose estimation error falls within the bounds.     

Queue-based local scheduling and global coordination for real-time operation control in a container terminal

To maximize the productivity of a container terminal, the operations of various types of equipments should be optimized and synchronized in real time. However, use of optimization techniques such as mathematical programming or search-based meta-heuristics becomes difficult when given a large-scaled problem due to their high computational cost. Addressing this problem, the queue-based local scheduling and global coordination method proposed in this paper stands as a viable alternative. The method consists of the following steps. First, separate schedules are locally generated for each equipment type using a queue-based dispatching heuristic which pays attention to the queue lengths of the quay cranes (QCs) under service. Next, the schedules are executed via a simulation and a notable QC delay is identified. Based on the analysis on the causes of this delay, some compromising adjustments are made to the priorities of relevant jobs. Then, the localized scheduling followed by the adjustment is repeated until the termination condition is met. Adopting simple heuristics in the local scheduling phase, the overall process easily meets the real-time constraint, yet producing an integrated schedule with a better global perspective than the myopic heuristic-only approach.     

Decentralized robust set-valued state estimation in networked multiple sensor systems

This paper addresses a decentralized robust set-valued state estimation problem for a class of uncertain systems via a data-rate constrained sensor network. The uncertainties of the systems satisfy an energy-type constraint known as an integral quadratic constraint. The sensor network consists of spatially distributed sensors and a fusion center where set-valued state estimation is carried out. The communications from the sensors to the fusion center are through data-rate constrained communication channels. We propose a state estimation scheme which involves coders that are implemented in the sensors, and a decoder–estimator that is located at the fusion center. Their construction is based on the robust Kalman filtering techniques. The robust set-valued state estimation results of this paper involve the solution of a jump Riccati differential equation and the solution of a set of jump state equations.     

A constraint-based approach for the shift design personnel task scheduling problem with equity

This paper presents an industrial problem which arises in a company specialized in drug evaluation and pharmacology research. The aim is to build employee timetables covering the demand given by a set of fixed tasks. The optimality criterion concerns the equity of the workload sharing. A solution to this problem is the assignment of all tasks whose resulting working shifts respect tasks requirements as well as legal and organizational constraints. Scheduling problems usually consider a fixed set of shifts which have to be assigned to a given number of employees whereas in our problem shifts are not fixed and are deduced from the task assignment. In the following, we refer to this problem as the shift-design personnel task scheduling problem with an equity criterion (SDPTSP-E), in reference to the shift minimization personnel task scheduling problem (SMPTSP). Even if the SDPTSP-E is related to several problems, none of them allow to grasp its full complexity. Consequently, we propose a dedicated method based on constraint programming. Several branching and exploration strategies are proposed and tested.     

On-line multiversion database concurrency control

This paper presents a new model for studying the concurrency vs. computation time tradeoffs involved in on-line multiversion database concurrency control. The basic problem that is studied in our model is the following: Given:a current database system state which includes information such as which transaction previously read a version from which other transaction; which transaction has written which versions into the database; and the ordering of versions previously written; anda set of read and write requests of requesting transactions. Question: Does there exist a new database system state in which the requesting transactions can be immediately put into execution (their read and write requests satisfied, or in the case of predeclared writeset transactions, write requests are guaranteed to be satisfied) while preserving consistency under a given set of additional constraints? (The amount of concurrency achieved is defined by the set of additional constraints). In this paper we derive “limits” of performance achievable by polynomial time concurrency control algorithms. Each limit is characterized by a minimal set of constraints that allow the on-line scheduling problem to be solved in polynomial time. If any one constraint in that minimal set is omitted, although it could increase the amount of concurrency, it would also have the dramatic negative effect of making the scheduling problem NP-complete; whereas if we do not omit any constraint in the minimal set, then the scheduling problem can be solved in polynomial time. With each of these limits, one can construct an efficient scheduling algorithm that achieves an optimal level of concurrency in polynomial computation time according to the constraints defined in the minimal set.     

Robust global stabilization of linear systems with input saturation via gain scheduling

The problem of robust global stabilization of linear systems subject to input saturation and input‐additive uncertainties is revisited in this paper. By taking advantages of the recently developed parametric Lyapunov equation‐based low gain feedback design method and an existing dynamic gain scheduling technique, a new gain scheduling controller is proposed to solve the problem. In comparison with the existing ?₂‐type gain scheduling controller, which requires the online solution of a state‐dependent nonlinear optimization problem and a state‐dependent ?₂ algebraic Riccati equation (ARE), all the parameters in the proposed controller are determined a priori. In the absence of the input‐additive uncertainties, the proposed controller also partially recovers Teel's ?_∞‐type scheduling approach by solving the problem of global stabilization of linear systems with actuator saturation. The ?_∞‐type scheduling approach achieves robustness not only with non‐input‐additive uncertainties but also requires the closed‐form solution to an ?_∞ ARE. Thus, the proposed scheduling method also addresses the implementation issues of the ?_∞‐type scheduling approach in the absence of non‐input‐additive uncertainties. Copyright © 2009 John Wiley & Sons, Ltd.     

Energy efficient scheduling of parallel tasks on multiprocessor computers

In this paper, scheduling parallel tasks on multiprocessor computers with dynamically variable voltage and speed are addressed as combinatorial optimization problems. Two problems are defined, namely, minimizing schedule length with energy consumption constraint and minimizing energy consumption with schedule length constraint. The first problem has applications in general multiprocessor and multicore processor computing systems where energy consumption is an important concern and in mobile computers where energy conservation is a main concern. The second problem has applications in real-time multiprocessing systems and environments where timing constraint is a major requirement. Our scheduling problems are defined such that the energy-delay product is optimized by fixing one factor and minimizing the other. It is noticed that power-aware scheduling of parallel tasks has rarely been discussed before. Our investigation in this paper makes some initial attempt to energy-efficient scheduling of parallel tasks on multiprocessor computers with dynamic voltage and speed. Our scheduling problems contain three nontrivial subproblems, namely, system partitioning, task scheduling, and power supplying. Each subproblem should be solved efficiently, so that heuristic algorithms with overall good performance can be developed. The above decomposition of our optimization problems into three subproblems makes design and analysis of heuristic algorithms tractable. A unique feature of our work is to compare the performance of our algorithms with optimal solutions analytically and validate our results experimentally, not to compare the performance of heuristic algorithms among themselves only experimentally. The harmonic system partitioning and processor allocation scheme is used, which divides a multiprocessor computer into clusters of equal sizes and schedules tasks of similar sizes together to increase processor utilization. A three-level energy/time/power allocation scheme is adopted for a given schedule, such that the schedule length is minimized by consuming given amount of energy or the energy consumed is minimized without missing a given deadline. The performance of our heuristic algorithms is analyzed, and accurate performance bounds are derived. Simulation data which validate our analytical results are also presented. It is found that our analytical results provide very accurate estimation of the expected normalized schedule length and the expected normalized energy consumption and that our heuristic algorithms are able to produce solutions very close to optimum.     

Minimum-Time Aggregation Scheduling in Duty-Cycled Wireless Sensor Networks

Aggregation is an important and commonplace operation in wireless sensor networks. Due to wireless interferences, aggregation in wireless sensor networks often suffers from packet collisions. In order to solve the collision problem, aggregation scheduling is extensively researched in recent years. In many sensor network applications such as real-time monitoring, aggregation time is the most concerned performance. This paper considers the minimum-time aggregation scheduling problem in duty-cycled wireless sensor networks for the first time. We show that this problem is NP-hard and present an approximation algorithm based on connected dominating set. The theoretical analysis shows that the proposed algorithm is a nearly-constant approximation. Simulation shows that the scheduling algorithm has a good performance.     

A constraint programming-based approach to a large-scale energy management problem with varied constraints

This paper addresses a large-scale power plant maintenance scheduling and production planning problem, which has been proposed by the ROADEF/EURO Challenge 2010. We develop two lower bounds for the problem: a greedy heuristic and a flow network for which a minimum cost flow problem has to be solved. Furthermore, we present a solution approach that combines a constraint programming formulation of the problem with several heuristics. The problem is decomposed into an outage scheduling and a production planning phase. The first phase is solved by a constraint program, which additionally ensures the feasibility of the remaining problem. In the second phase we utilize a greedy heuristic—developed from our greedy lower bound—to assign production levels and refueling amounts for a given outage schedule. All proposed strategies are shown to be competitive in an experimental evaluation.     

Single machine due date assignment scheduling problem with customer service level in fuzzy environment

Due date assignment scheduling problems with deterministic and stochastic parameters have been studied extensively in recent years. In this paper, we consider a single machine due date assignment scheduling problem with uncertain processing times and general precedence constraint among the jobs. The processing times of the jobs are assumed to be fuzzy numbers. We first propose an optimal polynomial time algorithm for the problem without precedence constraints among jobs. Then, we show that if general precedence constraint is involved, the problem is NP-hard. Finally, we show that if the precedence constraint is a tree or a collection of trees, the problem is still polynomially solvable.     

Project scheduling under resource constraints: Application of the cumulative global constraint in a decision support framework

This paper concerns project scheduling under resource constraints. Traditionally, the objective is to find a unique solution that minimizes the project makespan, while respecting the precedence constraints and the resource constraints. This work focuses on developing a model and a decision support framework for industrial application of the cumulative global constraint. For a given project scheduling, the proposed approach allows the generation of different optimal solutions relative to the alternate availability of outsourcing and resources. The objective is to provide a decision-maker an assistance to construct, choose, and define the appropriate scheduling program taking into account the possible capacity resources. The industrial problem under consideration is modeled as a constraint satisfaction problem (CSP). It is implemented under the constraint programming language CHIP V5. The provided solutions determine values for the various variables associated to the tasks realized on each resource, as well as the curves with the profile of the total consumption of resources on time.     

分布式网络化控制系统优化协同设计

网络化控制系统的性能不仅与控制器的设计有关还与网络QoS有密切的联系;针对基于CAN总线协议的多闭环控制系统共享网络带宽的控制与资源调度协同设计问题,首先给出连续控制系统性能指标与传输延迟、采样周期的近似线性关系,然后以此为目标函数,以不可抢占RM可调度性和控制系统稳定性为约束条件,分配网络带宽,使控制系统整体性能最优,并对得到的传输周期进行谐调化处理,提高网络利用率;采用资源预留方法在不影响周期数据实时性的前提下,保证非周期数据的平均响应时间;最后将协调设计结果应用于某基于CANopen协议的分布式控制实验系统,控制3组倒立摆,通过研究脉冲响应并已有的调度策略比较说明了所提出策略可以有效提高控制系统性能及带宽利用率.     

Indefinite LQ optimal control for stochastic Takagi–Sugeno fuzzy system under sensor data scheduling: Finite-horizon case

The present paper considers the finite-horizon indefinite linear quadratic (LQ) control problem for stochastic Takagi–Sugeno (T-S) fuzzy systems with input delay. In this paper, we consider the presence of sensor data scheduling, which imposes a communication energy constraint and necessitates optimal state estimation for measurements. Then, by utilizing dynamic programming principles, the stochastic LQ problem under consideration can be solved, while the optimal control policy is developed in terms of the unique solutions to a set of coupled difference Riccati equations (CDREs). Specifically, for simple delay-free case, the linear matrix inequalities based conditions are also proposed, whose feasibility is shown to be equivalent to the well-posedness of the indefinite LQ control under consideration. As an application, our theoretic analysis is extended to study the intermittent observation model caused by random denial-of-service attack.