Fuzzy project scheduling

Author

Pan, Hongqi ; Yeh, Chung-Hsing

Author_Institution

Sch. of Bus. Syst., Monash Univ., Clayton, Vic., Australia

Volume

1

fYear

2003

Firstpage

755

Abstract

Resource-constrained Project Scheduling (RCPS) is one of the NP-hard classes because of the complexity of their combinatorial nature. Any exact algorithms are difficult to handle such a problem. In addition, uncertainty also often exists in many projects in the process of the estimate of activity durations. This paper presents the framework of a fuzzy genetic algorithm combined with tabu mechanism for fuzzy RCPS in order to obtain an approximate optimal solution. This approach can handle both fuzzy and crisp numbers that commonly coexist in many realistic RCPS problems. To demonstrate the algorithm developed, a real case of an overhaul schedule is considered as a fuzzy RCPS problem.

Keywords

computational complexity; fuzzy set theory; genetic algorithms; scheduling; search problems; NP-hard classes; activity durations; approximate optimal solution; combinatorial complexity; crisp numbers; fuzzy numbers; fuzzy project scheduling; genetic algorithm; metaheuristic approach; overhaul schedule; priority rules; resource-constrained project scheduling; tabu mechanism; uncertain activity duration times; Arithmetic; Delta modulation; Fuzzy sets; Genetic algorithms; Hybrid power systems; Processor scheduling; Resource management; Scheduling algorithm; Stochastic processes; Uncertainty;

fLanguage

English

Publisher

ieee

Conference_Titel

Fuzzy Systems, 2003. FUZZ '03. The 12th IEEE International Conference on

Print_ISBN

0-7803-7810-5

Type

conf

DOI

10.1109/FUZZ.2003.1209458

Filename

1209458