The deregulation in power systems brings some new issues in equipment maintenance scheduling where more coordination and communication among different entities is required. In this paper, the mobile agent software is applied in the facility maintenance scheduling in deregulated power systems environment. In the given example, the problem is de-coupled into a master problem and a sub-problem usi...

Distributed systems (e.g. a LAN of computers) can be used for concurrent processing for some applications. However, a serious difficulty in concurrent programming of a distributed system is how to deal with scheduling and load balancing of such a system which may consist of heterogeneous computers. Distributed scheduling schemes suitable for parallel loops with independent iterations on heterog...

In this report, we consider the problem of scheduling an application composed of independent tasks on a fully heterogeneous master-worker platform with communication costs. We introduce a bi-criteria approach aiming at maximizing the throughput of the application while minimizing the energy consumed by participating resources. Assuming arbitrary super-linear power consumption laws, we investiga...

We describe one type of scheduling problem, that of scheduling final exams at Memorial University (MUN), a comprehensive Canadian university. It is well-known that the general scheduling problem is NP-complete [1]. Over the years, this problem has attracted a lot of attention and many different approaches have been tried in finding approximate solutions [2]. Here we propose an approximate solut...

The Controller Area Network (CAN) is an event-triggered protocol that is widely used in distributed real-time embedded systems. It has been demonstrated that a “Shared-Clock” (S-C) scheduling protocol can be used on top of CAN hardware to implement time-triggered network operations. Previous work in this area has led to the development of five different time-triggered S-C scheduling protocols r...

We consider a special class of large-scale, network-based, resource allocation problems under uncertainty, namely that of multi-commodity flows with time-windows under uncertainty. In this class, we focus on problems involving commodity pickup and delivery with time windows. Our work examines methods of proactive planning, that is, robust plan generation to protect against future uncertainty. B...