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

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 w...

Full description

Saved in:
Bibliographic Details
Published in2009 International Conference on Machine Learning and Cybernetics Vol. 1; pp. 597 - 601
Main Authors Xie Yuan, Linlin Ou
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.07.2009
Subjects
bicriteria
Cybernetics
fuzzy due dates
genetic algorithm
Machine learning
Parallel machines
parallel machines scheduling
Pareto optimal
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9781424437023
1424437024
ISSN:2160-133X
DOI:10.1109/ICMLC.2009.5212516