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

Two scheduling problems with fuzzy due-dates

โœ Scribed by Hiroaki Ishii; Minoru Tada; Teruo Masuda


Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
591 KB
Volume
46
Category
Article
ISSN
0165-0114

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Fuzzy due-date scheduling problem with f
โœ Takeshi Itoh; Hiroaki Ishii ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 149 KB

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.

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

Two due date assignment problems in sche
โœ Dvir Shabtay; George Steiner ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 199 KB

We study two single-machine scheduling problems: minimizing the sum of weighted earliness, tardiness and due date assignment penalties and minimizing the weighted number of tardy jobs and due date assignment costs. We prove that both problems are strongly NP-hard and give polynomial solutions for so