Most practical work on AI planning systems during the last fifteen years has been based on hierarchical task network (HTN) d ecomposition, but until now, there has been very little analytical work on the properties of HTN planners. This paper describes how the complexity of HTN planning varies with various conditions on the task networks. networks are required to be totally ordered, and (3) whe...

Task scheduling is concerned with the allocation of tasks onto underlying physical processors and the determination of the execution order of tasks residing on the same processor. EEcient scheduling of user tasks is critical to system and application performance in parallel programming. This paper proposes a new task mapping environment, ATME, dealing with the generation of an eecient schedulin...

We developed the Guideline Execution by Semantic Decomposition of Representation (GESDOR) model to share guidelines encoded in different formats at the execution level. For this purpose, we extracted a set of generalized guideline execution tasks from the existing guideline representation models. We then created the mappings between specific guideline representation models and the set of the co...

In graphical or diagrammatic representations, not only the basic component of a diagram, but also a collection of multiple components can form a unit with semantic significance. We call such a collection a “global object”, and we consider how this can assist in reasoning using diagrammatic representation. In this paper, we investigate reasoning with correspondence tables as a case study. Corres...

Scheduling independent tasks on heterogeneous environments, like grids, is not trivial. To make a good scheduling plan on this kind of environments, the scheduler usually needs some information such as host speed, host load, and task size. This kind of information is not always available and is often difficult to obtain. In this paper we propose a scheduling approach that does not use any kind ...

The management of personal and shared schedules is limited by the lack of flexibility of time management services. Online calendar managers fail to support reasoning about time and multi-user activities. Task schedulers fully control the temporal allocation of events without involving their users in decision making. As an attempt to address such issues, this paper presents a mixedinitiative sch...

This paper considers the scheduling of parallel realtime tasks with arbitrary-deadlines. Each job of a parallel task is described as a directed acyclic graph (DAG). In contrast to prior work in this area, where decomposition-based scheduling algorithms are proposed based on the DAG-structure and inter-task interference is analyzed as self-suspending behavior, this paper generalizes the federate...

The main intent of the cloud computing to provide utilities demands users that are booming day by day. To meet requirements, existing scheduling algorithms focus on improving performance and neglecting energy consumed fulfill those demands. Hence, we propose a new Hybrid Scheduling Algorithm (HS) which is based Genetic (GA) Flower Pollination (FPA) for environments. proposed algorithm has surpa...

Problem statement: Cloud is purely a dynamic environment and the existing task scheduling algorithms are mostly static and considered various parameters like time, cost, make span, speed, scalability, throughput, resource utilization, scheduling success rate and so on. Available scheduling algorithms are mostly heuristic in nature and more complex, time consuming and does not consider reliabili...

Function design of embedded real-time system introduced the problem of real-time task scheduling with precedence constraint which needs that scheduling sequence produced by algorithm satisfying not only real-time constraint of every task, but also precedence constraint among tasks. Based on parallel topological sort, this paper presents a new on-line scheduling algorithm OSA-RPC which can set p...