This paper describes how PDDL2.1 level 3 may be used to encode timed literals as well as goals with deadlines, which means that planners that have been designed to reason with PDDL2.1 level 3 will not need to be modified in order to solve problems containing timed literals and goals with deadlines. Two encodings are introduced and some preliminary results are presented. In light of these result...

Presents information of interest to Society members.

A new optimality criterion and associated scheduling and dropping algorithm are presented for multiclass packets with deadlines. Equal length packets with deadlines and priority labels are either scheduled by their deadlines or dropped on or possibly before their deadlines. An L-bit priority label is used to handle up to 2 priority classes. A scheduling policy is called lex-optimal within the c...

Traditional real-time systems are designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an interest in exploring non-preemptive scheduling models for real-time systems, particularly for soft real-time multimedia applications. In this paper we propose a new algorithm that uses multiple scheduling strateg...

We study non-preemptive, online admission control in the hard deadline model: each job must be either serviced prior to its deadline, or be rejected. Our setting consists of a single resource that services an online sequence of jobs; each job has a length indicating the length of time for which it needs the resource, and a delay indicating the maximum time it can wait for the service to be star...

We examine a conditional scheduling model in which the deadlines of jobs are allowed to vary. We explore variants of the basic model and locate the dividing line between NP-hard and polynomial-time problems. Suppose that an engineer needs to design one of two devices, either A or B. Each device will require nine months of work. The due date of both A and B is in one year, but only one device wi...

It is shown that the competitive factor for online scheduling of unit-length packets with hard deadlines in slotted time is in the interval [0.5, φ], where φ is the inverse of the golden ratio, φ = ( √ 5 − 1)/2 ≈ 0.618034. Moreover, any static priority policy, that in each slot schedules a maximum value packet irrespective of deadlines, achieves competitive factor 0.5.