The road ahead : it doesn't get any easier p. 4 Modeling real-time systems p. 5 Integrated resource management and scheduling with multi-resource constraints p. 12 Finite-horizon scheduling of radar dwells with online template construction p. 23 Feasibility analysis of preemptive real-time systems upon heterogeneous multiprocessor platforms p. 37 Negative results for scheduling independent hard...

Data generation for computational testing of optimization algorithms is a key topic in experimental algorithmics. Recently, concern has arisen that many published computational experiments are inadequate with respect to the way test instances are generated. In this paper we suggest a new research direction that might be useful to cope with the possible limitations of data generation. The basic ...

In this paper, we propose a finite-state Markov model for per-user service of an opportunistic scheduling scheme over Rayleigh fading channels, where a single base station serves an arbitrary number of users. By approximating the power gain of Rayleigh fading channels as finite-state Markov processes, we develop an algorithm to obtain dynamic stochastic model of the transmission service, receiv...

This paper gives a new application of DEA to evaluate the scheduling solutions of parallel processing. It evaluates the scheduling solutions of parallel processing using the non-convex DEA model, FDH model. By introducing each solution of parallel processing scheduling as a DMU with some relevant inputs and outputs this paper shows that how the most efficient schedule(s) can be identified.

the conventional method towards deriving schedule for a fleet of ships to minimize cost alone has the short-coming of not addressing the problem of operation revenue losses associated with delays during maintenance at ships dockyards. in this paper, a preventive maintenance schedule for a fleet of ships that incorporates op-portunity cost is presented. the idea is to assign a penalty cost to al...

An elegant way to tackle a problem that you cannot solve is to cast it to a problem that you can solve very well. Cyclic Scheduling problems are very similar to Resource Constrained Project Scheduling Problems (RCPSP), except that the project activities are repeated over time. Due to the similarity, reducing Cyclic Scheduling problems to RCPSPs seems an appealing approach. In this paper we disc...

As implied by the word “packet scheduling”, the shared transmission resource should be intentionally assigned to some users at a given time. The process of assigning users’ packets to appropriate shared resource to achieve some performance guarantee is so-called packet scheduling. It is anticipated that packetized transmissions over links via proper packet scheduling algorithms will possibly ma...

A multi-class single-server queueing model with finite buffers, in which scheduling and admission of customers are subject to control, is studied in the moderate deviation heavy traffic regime. A risk-sensitive cost set over a finite time horizon [0, T ] is considered. The main result is the asymptotic optimality of a control policy derived via an underlying differential game. The result is the...

We consider online scheduling so as to maximize the minimum load, using a reordering buffer which can store some of the jobs before they are assigned irrevocably to machines. For m identical machines, we show an upper bound of Hm−1 + 1 for a buffer of size m − 1. A competitive ratio below Hm is not possible with any finite buffer size, and it requires a buffer of size Ω̃(m) to get a ratio ofO(lo...