The static and analytic scheduling approach is very difficult to follow and is not always applicable in real-time. Most of the scheduling algorithms are designed to be established in offline environment. However, we are challenged with three characteristics in real cases: First, problem data of jobs are not known in advance. Second, most of the shop’s parameters tend to be stochastic. Third, th...

Today's competitive conditions have caused the projects to be carried out in the least possible time with limited resources. Therefore, managing and scheduling a project is a necessity for the project. The timing of a project is to specify a sequence of times for a series of related activities. According to their priority and their latency, so that between the time the project is completed and ...

Task scheduling is one of the main challenges in every system design, and especially in embedded systems design. Task scheduling might be classified in two broad categories: (1) compile time (static scheduling) or (2) run time (dynamic scheduling). Recently there has been a growing interest in the development of run-time scheduling techniques for platform-based designs [1][2]. This interest is ...

In this paper, we explore the feasibility of enabling the scheduling of mixed hard and soft real-time MapReduce applications. We first present an experimental evaluation of the popular Hadoop MapReduce middleware on the Amazon EC2 cloud. Our evaluation reveals tradeoffs between overall system throughput and execution time predictability, as well as highlights a number of factors affecting real-...

in the directory /pub/techreports. Abstracts and compressed postscript files are available via Real-time, multi-tasking software, such as that used in embedded control systems, is notoriously difficult to develop and maintain. Scheduling theory offers a mathematically-sound way of predicting the timing behaviour of sets of communicating, concurrent tasks, but its principles are often unfamiliar...

This paper develops a novel scheduling mechanism for packet switches based on a minimal set of hardware components. The standard model of computation implemented by digital logic is replaced by a model based on time encoding. This new model allows for distributed computation with low hardware complexity. A distributed switch scheduling algorithm utilizing time encoding is shown to deliver perfo...

irrigation scheduling means applying the right amount of water at the right time. in this research, thecurrent irrigation scheduling implemented in the mirza-kuchak-khan sugarcane agro-industry farmslocated in ahwaz was compared with the actual sugarcane crop water requirement using swapmodel. due to lack of field measured data, the swap model was calibrated and evaluated usinglandsat 7 etm+ im...

Recent results in the application of scheduling theory to dependable real-time systems are reviewed. The review takes the form of an analysis of the problems presented by different application requirements and characteristics. Issues covered include uniprocessor and multiprocessor systems, periodic and aperiodic processes, static and dynamic algorithms, transient overloads and resource usage. P...

We propose a new approach for scheduling with strict deadlines and apply this approach to the TimeConstrained Project Scheduling Problem (TCPSP). To be able to meet these deadlines, it is possible to work in overtime or hire additional capacity in regular time or overtime. For this problem, we develop a two stage heuristic. The key of the approach lies in the first stage in which we construct p...