Results 281 to 290 of about 61,394 (313)

The dynamics of software project scheduling

Communications of the ACM, 1983
Software project scheduling is one of the major problem areas faced by software project managers today. While several quantitative software project resource and schedule estimation methods have been developed, such techniques raise some important, but as yet unresolved, dynamic issues.
Tarek K. Abdel-Hamid, Stuart E. Madnick
openaire   +1 more source

Dynamic scheduling with incomplete information

Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures - SPAA '98, 1998
We consider the following scheduling problem: Our goal is to execute a given amount of arbitrarily decomposable work on a distributed machine as quickly as possible. The work is maintained by a central scheduler that can assign chunks of work of an arbitrary size to idle processors. The difficulty is that the processing time required for a chunk is not
openaire   +2 more sources

Dynamic Interday and Intraday Scheduling

Operations Research
Adaptive Patient Flow Management Appointment scheduling has significant clinical, operational, and economical impact on healthcare systems. An informed scheduling strategy that can effectively match patient demand and service capacity dynamically is vital for the business of medical providers, quality of care, and patient satisfaction.
Christos Zacharias, Nan Liu 0004, Mehmet A. Begen   +2 more
openaire   +2 more sources

ONLINE SCHEDULING OF DYNAMIC TREES

Parallel Processing Letters, 1995
The scheduling problem for dynamic tree-structured task graphs is studied and is shown to be inherently more difficult than the static case. It is shown that any online scheduling algorithm, deterministic or randomized, has competitive ratio Ω((1/g)/ log d(1/g)) for trees with granularity g and degree at most d.
Michael A. Palis, Jing-Chiou Liou, Sanguthevar Rajasekaran, Sunil M. Shende, David S. L. Wei   +4 more
openaire   +1 more source

“Agency scheduling” A model for dynamic task scheduling

1995
This paper describes a class of algorithms for scheduling parallel programs represented by macro dataflow graphs (task precedence graphs) onto a multiprocessor system such that the total execution time is minimized. The schedule will be computed dynamically during the runtime of the process system.
Johann Rost, Franz-Josef Markus, Li Yan-Hua   +2 more
openaire   +1 more source

Dynamic Scheduling with Genetic Programming

2006
This paper investigates the use of genetic programming in automatized synthesis of scheduling heuristics. The applied scheduling technique is priority scheduling, where the next state of the system is determined based on priority values of certain system elements. The evolved solutions are compared with existing scheduling heuristics for single machine
Budin, Leo, Jakobović, Domagoj
openaire   +2 more sources

Dynamic Scheduling for Seamless Computing

2018 IEEE 8th International Symposium on Cloud and Service Computing (SC2), 2018
The data generated by Internet of Things (IoT) devices is constantly increasing. The use of cloud computing to process this data is associated with network congestion, has high latency and does not provide context awareness. Fog computing has been proposed as a solution to overcome these problems.
Ludwig Mittermeier, Florian Katenbrink, Andreas Seitz, Harald Müller 0002, Bernd Bruegge   +4 more
openaire   +1 more source

Scheduling the dynamic job shop

[1993] Proceedings IEEE International Conference on Robotics and Automation, 2002
The augmented Lagrangian decomposition and coordination technique is applied to a continuous-time formulation of the scheduling problem in a job shop environment. This methodology generates a variety of information that can be used to initialize the algorithm after changes occur, including Lagrange multipliers.
Debra J. Hoitomt, Peter B. Luh
openaire   +1 more source

An expert system for dynamic scheduling

Proceedings of the ACM SIGART international symposium on Methodologies for intelligent systems, 1986
Traditionally, scheduling problems have been viewed as static in nature (i.e., a schedule is developed for a particular planning horizon and adhered to) and were cast as having one or more clearly defined objectives (e.g., minimize overall completion time, maximize resource utilization, etc.). These problems were most commonly solved via application of
Donnie R. Ford, S. Floyd
openaire   +1 more source

Performances of a Dynamic Threads Scheduler

2001
This paper presents the design and development of a dynamic scheduler of parallel threads in the Multithreaded multiProcessor Architecture (MPA). The scheduler relies on an on-chip associative memory whose management time is overlapped with the execution of ready threads.
Smaïl Niar, Mahamed Adda
openaire   +1 more source