Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- articleNovember 2015
Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems
International Journal of Systems Science (IJSS), Volume 46, Issue 15Pages 2673–2685https://doi.org/10.1080/00207721.2013.876679This paper presents a neighbourhood generation mechanism for the job shop scheduling problems JSSPs. In order to obtain a feasible neighbour with the generation mechanism, it is only necessary to generate a permutation of an adjacent pair of operations ...
- articleJune 2006
Optimal Scheduling for Real-Time Parallel Tasks*This work was supported by the Research Grant from Hallym University, Korea and the ITRC program of the Korea Ministry of Information & Communications under grant IITA-2005-(C1090-0502-0020).
IEICE - Transactions on Information and Systems (TROIS), Volume E89-D, Issue 6Pages 1962–1966https://doi.org/10.1093/ietisy/e89-d.6.1962We propose an optimal algorithm for the real-time scheduling of parallel tasks on multiprocessors, where the tasks have the properties of flexible preemption, linear speedup, bounded parallelism, and arbitrary deadline. The proposed algorithm is optimal ...
- ArticleAugust 2002
Two processor scheduling with real release times and deadlines
SPAA '02: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architecturesPages 127–132https://doi.org/10.1145/564870.564889In a hard real-time system, critical tasks are subject to timing constraints such as release times and deadlines. All timing constraints must be satisfied when tasks are executed. Nevertheless, given a set of tasks, finding a feasible schedule which ...
- ArticleOctober 2000
A Fast Algorithm for Scheduling Instructions with Deadline Constraints on RISC Processors
We present a fast algorithm for scheduling UET (Unit Execution Time) instructions with deadline constraints in a basic block on RISC machines with multiple processors. Unlike Palem and Simon's algorithm, our algorithm allows latency of lij = -1 which ...
- ArticleAugust 1997
Real-Time Job Scheduling in Hypercube Systems
In this paper, we present the problem of scheduling real-time jobs in a hypercube system and propose a scheduling algorithm. The goals of the proposed scheduling algorithm are to determine whether all jobs can complete their processing before their ...
- ArticleDecember 1996
The MSP.RTL real-time scheduler synthesis tool
MSP.RTL is a tool for producing real time schedulers for a wide variety of timing constraints. The input to MSP.RTL can be customized for different application domains, as long as their timing semantics can be expressed in RTL (real time logic). The ...
- research-articleJuly 1991
A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems
IEEE Transactions on Software Engineering (ISOF), Volume 17, Issue 7Pages 669–677https://doi.org/10.1109/32.83903Process scheduling, an important issue in the design and maintenance of hard real-time systems, is discussed. A pre-run-time scheduling algorithm that addresses the problem of process sequencing is presented. The algorithm is designed for multiprocessor ...
- research-articleApril 1990
Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems (TPDS), Volume 1, Issue 2Pages 184–194https://doi.org/10.1109/71.80146Efficient scheduling algorithms based on heuristic functions are developed for scheduling a set of tasks on a multiprocessor system. The tasks are characterized by worst-case computation times, deadlines, and resources requirements. Starting with an ...