✦ LIBER ✦

LPT scheduling for fuzzy tasks

✍ Scribed by Tzung-Pei Hong; Cheng-Ming Huang; Kun-Ming Yu

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 666 KB
Volume: 97
Category: Article
ISSN: 0165-0114
DOI: 10.1016/s0165-0114(96)00357-0

No coin nor oath required. For personal study only.

✦ Synopsis

Scheduling mainly concerns allocating resources to tasks over time, under necessary constraints. In the past, the processing time for each task was usually assigned or estimated as a fixed value. In many real-world applications, however, the processing time for each job may vary dynamically with the situation. In this paper, fuzzy concepts are utilized in the LPT algorithm for managing uncertain scheduling. Given a set of tasks, each with its membership function for the processing time, the fuzzy LPT algorithm can get a scheduling result with a membership function for the final completion time. Also, the conventional LPT scheduling algorithm is shown as a special case of the fuzzy LPT scheduling algorithm with special membership functions being assigned. The fuzzy LPT scheduling algorithm is then a feasible solution for both deterministic and uncertain scheduling.

📜 SIMILAR VOLUMES

Fault-tolerant LPT task scheduling in mu

Fault-tolerant LPT task scheduling in multiprocessor systems

✍ Alan A Bertossi; Luigi Mancini 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 838 KB

Feedback fuzzy-DVS scheduling of control

Feedback fuzzy-DVS scheduling of control tasks

✍ Hong Jin; Danli Wang; Hongan Wang; Hui Wang 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 485 KB

An LPT-Bound for a Parallel Multiprocess

An LPT-Bound for a Parallel Multiprocessor Scheduling Problem

✍ F. Harche; S. Seshadri 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 476 KB

Real time task scheduling allowing fuzzy

Real time task scheduling allowing fuzzy due dates

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

The paper deals with periodical task scheduling. The tasks are described by fuzzy due dates and fuzzy execution times. The goal of scheduling is to find an optimal assignment of priorities such that the satisfaction associated with due dates and execution times be minimized. The paper shows how the

Scheduling algorithm for nonpreemptive m

Scheduling algorithm for nonpreemptive multiprocessor tasks

✍ J.-F. Lin; S.-J. Chen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 619 KB

This paper considers the problem of scheduling nonpreemptive multiprocessor tasks in a homogeneous system of processors. The problem proposed in this paper is different from the conventional scheduling problem, where each task requires only "one" processor whenever it is in processing. In our multip

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