One Machine Scheduling Problem with Fuzzy Random Due-Dates

Authors:
Takeshi Itoh;Hiroaki Ishii
Affiliations:
Faculty of Information Science, University of Marketing and Distribution Sciences, Kobe, Japan 651-2188;Graduate School of Information Science and Technology, Osaka University, Osaka, Japan 565-0871
Venue:
Fuzzy Optimization and Decision Making
Year:
2005

Citing 0
Cited 5

Recent Literature Collected by Didier DUBOIS, Henri PRADE and Salvatore SESSA

Fuzzy Sets and Systems
Solving the fuzzy earliness and tardiness in scheduling problems by using genetic algorithms

Expert Systems with Applications: An International Journal
A multi-objective chance-constrained network optimal model with random fuzzy coefficients and its application to logistics distribution center location problem

Fuzzy Optimization and Decision Making
Evaluate the fuzzy completion times in the fuzzy flow shop scheduling problems using the virus-evolutionary genetic algorithms

Applied Soft Computing
Measures of problem uncertainty for scheduling with interval processing times

OR Spectrum

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many classical or basic scheduling models, jobs' processing times and due-dates are crisp values. Recently, they have been formulated as uncertain values in some more actual models. That is the introduction of ''fuzziness''. However, in a real situation of decision making, there exists uncertainty that can not be described only by fuzziness. In this paper, we propose an n-job, one machine scheduling model, where due-dates for jobs are fuzzy random variables. In the model, jobs' processing times are crisp, and we assign satisfaction levels to jobs' completion times according to membership functions. They are non-increasing functions, but their support positions depend upon the expected due-dates, which are exponentially distributed random variables.