Bicriteria parallel machines scheduling problem with fuzzy due dates based on NPGA

Author

Yuan, Xie ; Ou, Linlin

Author_Institution

Sch. of Electr., Shanghai Dianji Univ., Shanghai, China

Volume

1

fYear

2009

fDate

12-15 July 2009

Firstpage

597

Lastpage

601

Abstract

A kind of unrelated parallel machines scheduling problem with fuzzy due dates was discussed. The memberships of fuzzy due dates denoted the grades of satisfaction of decision-maker with respect to completion times with jobs. Objectives of scheduling is to maximize the minimum grade of satisfaction while makespan is minimized in the meantime. Niched Pareto genetic algorithm (NPGA) was employed to search the Pareto optimal solution sets for above bicriteria scheduling problem. Numerical simulation illustrates that ability of NPGA to find and maintain Pareto optimal solutions set in population.

Keywords

Pareto optimisation; computational complexity; fuzzy set theory; genetic algorithms; scheduling; Pareto optimal solution sets; bicriteria parallel machines scheduling problem; decision-maker satisfaction; fuzzy due dates; niched Pareto genetic algorithm; Cybernetics; Machine learning; Parallel machines; Pareto optimal; bicriteria; fuzzy due dates; genetic algorithm; parallel machines scheduling;

fLanguage

English

Publisher

ieee

Conference_Titel

Machine Learning and Cybernetics, 2009 International Conference on

Conference_Location

Baoding

Print_ISBN

978-1-4244-3702-3

Electronic_ISBN

978-1-4244-3703-0

Type

conf

DOI

10.1109/ICMLC.2009.5212516

Filename

5212516