๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Fuzzy due-date scheduling problem with fuzzy processing time

โœ Scribed by Takeshi Itoh; Hiroaki Ishii


Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
149 KB
Volume
6
Category
Article
ISSN
0969-6016

No coin nor oath required. For personal study only.

โœฆ Synopsis


For most of scheduling problems, jobs' processing times and due-dates are treated as certain values, but that is not proper to all actual situations. Processing times are not constant because of measurement errors in the data sets for deciding them and/or human actions in the manufacturing process. However, we may be permitted to exceed due-dates slightly. In this paper, we propose a model dealing with uncertain processing times and ยฏexible due-dates in consideration of real situations. Assuming the times and due-dates to be fuzzy numbers, and deยฎning a fuzzy tardiness for a job's due-date, we design to minimize the number of tardy jobs in our problem formulation.


๐Ÿ“œ SIMILAR VOLUMES


Multi-objective scheduling with fuzzy du
โœ Tadahiko Murata; Mitsuo Gen; Hisao Ishibuchi ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 268 KB

In this paper, we examine the characteristic features of multi-objective scheduling problems formulated with the concept of fuzzy due-date. By computer simulations, we show that various scheduling criteria can be expressed by modifying the shape of membership functions of fuzzy due-dates. We also sh

Real time task scheduling allowing fuzzy
โœ 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

Real-time task scheduling with fuzzy dea
โœ 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