We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
Embedded signal processing system is a typical type of application in embedded domain. Such systems typically have requirements on high real-time responsiveness and large buffer c...
The general approach to fault tolerance in uniprocessor systems is to use time redundancy in the schedule so that any task instance can be re-executed in presence of faults during...
We study the problem of scheduling unit time tasks of two types on m parallel identical machines. For each type, given numbers of tasks are required to be completed by the specifi...
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...