Jobshop scheduling with imprecise durations: a fuzzy approach

Author

Fortemps, Philippe

Author_Institution

Dept. of Math. & Oper. Res., Fac. Polytech. de Mons, Belgium

Volume

5

Issue

4

fYear

1997

fDate

11/1/1997 12:00:00 AM

Firstpage

557

Lastpage

569

Abstract

Jobshop scheduling problems are NP-hard problems. The durations in the reality of manufacturing are often imprecise and the imprecision in data is very critical for the scheduling procedures. Therefore, the fuzzy approach, in the framework of the Dempster-Shafer theory, commands attention. The fuzzy numbers are considered as sets of possible probabilistic distributions. After a review of some issues concerning fuzzy numbers, we discuss the determination of a unique optimal solution of the problem and then we cast a meta-heuristic (simulated annealing-SA) to this particular framework for optimization. It should be stressed that the obtained schedule remains feasible for all realizations of the operations durations

Keywords

computational complexity; fuzzy set theory; probability; production control; simulated annealing; uncertainty handling; Dempster-Shafer theory; NP-hard problems; fuzzy approach; fuzzy numbers; imprecise durations; jobshop scheduling; meta-heuristic; probabilistic distributions; simulated annealing; Associate members; Fuzzy set theory; Fuzzy sets; Heuristic algorithms; Job shop scheduling; Manufacturing; Probability distribution; Simulated annealing; Stochastic processes; Uncertainty;

fLanguage

English

Journal_Title

Fuzzy Systems, IEEE Transactions on

Publisher

ieee

ISSN

1063-6706

Type

jour

DOI

10.1109/91.649907

Filename

649907