We consider Priority Algorithm [BNR03] as a syntactic model of formulating the concept of greedy algorithm for Job Scheduling, and we study the computation of optimal priority algorithms. A Job Scheduling subproblem S is determined by a (possibly infinite) set of jobs, every finite subset of which potentially forms an input to a scheduling algorithm. An algorithm is optimal for S, if it gains o...

Fundamental theory on battery-powered cyberphysical systems (CPS) calls for dynamic models that are able to describe and predict the status of processors and batteries at any given time. We believe that the idealized system of single processor powered by single battery (SPSB) can be viewed as a generic case for the modeling effort. This paper introduces a dynamic model for multiple aperiodic ta...

This article studies the impact on the design of scheduling algorithms for Orthogonal Frequency Division Multiple Access (OFDMA) systems of two traffic models described in the evaluation methodology proposals from standardization bodies: the full buffer and the finite buffer traffic models. The analysis concentrates on utility-based scheduling with an a-fair utility function for Non-Real Time (...

In any computing environment, the availability of resources is finite, so effective utilization of resources is very important. To achieve effective management of the available resources in a scalable environment optimal mechanism is required. In order to do this, choosing of scheduling algorithm is important. The scheduling techniques should be selected in such a way that the various user dema...

Modern phased array radars are able to adaptively modify their performance to the environment. To make full use of this capability, scheduling algorithms need to be designed. This paper poses the problem of adaptive waveform scheduling for detecting new targets in the context of finite horizon stochastic dynamic programming. The result is a scheduling algorithm that minimises the time taken to ...

Although being a very fundamental problem in the field of wireless networks, the complexity of transmission scheduling with power control in the Geometric SINR model is still unknown. In this article, we show that the joint problem of finding transmission powers and scheduling the transmissions is NP-hard if the available powers are bounded, independent of the actual bounds. This also implies t...

Some products like green vegetables, volatile liquids and others deteriorate continuously due to evaporation, spoilage etc. In this study, an inventory model is developed for deteriorating items with linearly time dependent demand rate under inflation and time discounting over a finite planning horizon. Shortages are allowed and linearly time dependent. Mathematical model is presented for the p...

In this paper, we derive optimal and suboptimal beam scheduling algorithms for electronically scanned array tracking systems. We formulate the scheduling problem as a multiarm bandit problem involving hidden Markov models (HMMs). A finite-dimensional optimal solution to this multiarm bandit problem is presented. The key to solving any multiarm bandit problem is to compute the Gittins index. We ...