We consider several scheduling problems for packet based systems with time-varying channel conditions. Designing scheduling mechanisms that take advantage of time-varying channel conditions, which are different for different users, is necessary to improve system performance; however this has to be done in a way that provides some level of fairness among the users. Such scheduling mechanisms are...

background and objectives: operating room (or) scheduling is key to optimal operating room productivity. the significant uncertainty associated with surgery duration renders scheduling of surgical operation a challenging task. this paper proposes a novel computational stochastic model to optimize scheduling of surgeries with uncertain durations. the model considers various surgical operation co...

As energy harvesting communication systems emerge, there is a need for transmission schemes that dynamically adapt to the energy harvesting process. In this paper, after exhibiting a finite-horizon online throughput-maximizing scheduling problem formulation and the structure of its optimal solution within a dynamic programming formulation, a low complexity online scheduling policy is proposed. ...

In high-performance computing (HPC), workflow-based workloads are usually data intensive for exploratory analysis of a scientific computation problem that may involve a large parameter space. To achieve the best performance, storage resource constraint is always a pragmatic concern in reality as the potential problem space scale, especially in big data science, as well as its required dataset a...

This article develops an algorithm for a group of guards statically positioned in a nonconvex polygonal environment with holes. Each guard possesses a single searchlight, a ray sensor which can rotate about the guard’s position but cannot penetrate the boundary of the environment. A point is detected by a searchlight if and only if the point is on the ray at some instant. Targets are points whi...

Wireless contention is the most important and least studied characteristic of multi-hop networks. It is the most important because not only does it have a drastic effect on the performance but also it is the fundamental property which makes these networks very different from traditional wired and single-hop wireless networks. Finite bandwidth is only one of the sources of contention. In additio...

For example, Wein (1988) compared various release control strategies and scheduling rules and provided the better combinations of release control strategy and scheduling rule for three kinds of HP 24 models. Peyrol et al. (1993) implemented a simulated annealing methodology to determine the input order of a given set of products so as to minimize the average residence time of these products in ...

In this paper, packet loss probability performance in cell-based and packet-based switches with finite Input Queues (IQ) and iLPF scheduling algorithm are analysed. This algorithm has been proposed as a practical scheduling algorithm to achieve 100% throughput in cell-based switches. The scheduling algorithm is implemented in three cases: cellbased (CB-iLPF) switching, packet-based (PB-iLPF) sw...

As the 3G cdma2000 R © networks with High Data Rates get deployed, it is interesting to study the impact of the scheduling algorithms used in these networks, and to improve over their performance. In this paper, we introduce a quantized scheduling that takes into account the fact that mobile nodes and access points can communicate only through a finite set of rate or power vectors. This approac...