Within the combinatorial scheduling community, there has been an increasing interest in modelling and solving scheduling problems in dynamic environments. Such problems have also been considered in the field of queueing theory, but very few papers take advantage of developments in both areas, and literature surveys on dynamic scheduling usually make no mention of queueing approaches. In this pa...

Real world scheduling requirements are related with complex systems operating in dynamic environments. This means that they are frequently subject to several kinds of random occurrences and perturbations, such as new job arrivals, machine breakdowns, employee’s sickness and jobs cancellation causing prepared schedules becoming easily outdated and unsuitable. Scheduling under this environment is...

An innovative dynamic scheduling scheme is proposed to improve the efficiency of video-on-demand servers. We first introduce a paged segment striping model that makes dynamic scheduling possible. Based on this striping scheme, we propose a dynamic scheduling scheme that adapts to frequently changing workloads. In particular, we can change the round length without any additional disk access so t...

This paper describes the Dynamic Execution Order Scheduling (DEOS) system that has been developed to handle highly dynamic and interactive scheduling domains. Unlike typical scheduling problems which have a static task list, DEOS is able to handle dynamic task lists in which tasks are added, deleted and modified “on the fly" DEOS is also able to handle tasks with uncertain and/or probabilistic ...

| Runtime Incremental Parallel Scheduling (RIPS) is an alternative strategy to the commonly used dynamic scheduling. In this scheduling strategy, the system scheduling activity alternates with the underlying computation work. RIPS utilizes the advanced parallel scheduling technique to produce a low-overhead, high-quality load balancing, as well as adapting to irregular applications. This paper ...

Many modern logic programming languages provide more flexible scheduling than the Prolog traditional left-to-right computation rule. Computation generally also proceeds following some ñxed scheduling rule but certain goals are dynamically "delayed" until their arguments are sufficiently instantiated to allow the cali to run efliciently. This general form of scheduling is referred to as dynamic ...

Most of the research literature concerning scheduling concentrates on the static problems, i.e problems where all input data is known and does not change over time. However, the real world scheduling problems are very seldom static. Events like machine breakdown or bottleneck in some situation impossible to predict. Dynamic scheduling is a research field, which take into consideration uncertain...

Recently, high-performance computer architecture has focused on dynamic scheduling techniques to issue and execute multiple operations concurrently. These designs are complex and have frequently shown disappointing performance. A complementary approach is the use of static scheduling techniques to exploit the same parallelism. In this paper we describe some of the tradeoffs between the use of s...

In this paper, we analyze the characteristics of the dynamic job shop scheduling problem when machine breakdown and new job arrivals occur. A hybrid approach involving neural networks(NNs) and geneticalgorithm(GA) is presented to solve the dynamic job shop scheduling problem as a static scheduling problem. The objective of this kind of job shop scheduling problem is minimizing the completion ti...