✦ LIBER ✦

Real-time scheduling with both preemption and nonpreemption requirements

✍ Scribed by Xiaoping Yuan; Ashok K. Agrawala

Publisher: Elsevier Science
Year: 1989
Weight: 490 KB
Volume: 27
Category: Article
ISSN: 0165-6074
DOI: 10.1016/0165-6074(89)90147-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling with job release dates, deliv

Scheduling with job release dates, delivery times and preemption penalties

✍ Zhaohui Liu; T.C.Edwin Cheng 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 73 KB

We consider in this paper the single-machine preemptive scheduling problem with job release dates, delivery times and preemption penalties, where each time a job is started, whether initially or after preemption, a job-dependent setup must take place. First, we prove that the problem is strongly NP-

Real-time task scheduling with overheads

Real-time task scheduling with overheads considered

✍ Christian L. Cesar; Peter G. Jessel 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 858 KB

Real-time task scheduling with fuzzy dea

Real-time task scheduling with fuzzy deadlines and processing times

✍ Marin Litoiu; Roberto Tadei 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 116 KB

A set of n independent and periodical tasks are considered. The processing times and the deadlines are described by fuzzy numbers. We try to ÿnd the optimal assignment of priorities not to miss deadlines. We manage the problem in two ways: ÿrst, we solve the problem by introducing the new cost funct

Scheduling Algorithms with Fault Detecti

Scheduling Algorithms with Fault Detection and Location Capabilities for Real-Time Multiprocessor Systems

✍ K. Mahesh; G. Manimaran; C.Siva Ram Murthy; Arun K. Somani 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 444 KB

Several schemes for detecting and locating faulty processors through self-diagnosis in multiprocessor systems have been discussed in the past. These schemes attempt to start multiple copies (versions) of the tasks on available idle processors simultaneously and compare the results generated by the c

An efficient scheduling algorithm for di

An efficient scheduling algorithm for distributed real-time systems with end-to-end timing constraints

✍ Atsushi Togawa; Eiji Okubo 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB

This paper proposes an efficient scheduling algorithm for distributed real-time systems with such timing constraints as jitter and end-to-end timing. Conventionally, backtrack searching and annealing methods have been used for scheduling problems when timing constraints are complicated. These method

Batch-scheduling problems to minimize in

Batch-scheduling problems to minimize inventory cost in the shop with both receiving and delivery just-in-times

✍ Abdul Hakim Halim; Hiroshi Ohta 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 820 KB

If the shop capacity is tight, it may not be possible to make a schedule that leads the completion times of all the parts processed in the shop to be exactly at their due dates. As a result, the shop may have to incur a holding cost for the parts finished earlier. This paper addresses a multi-due-d