A genetic algorithm for parallel machine scheduling with due-date windows

A genetic algorithm for parallel machine scheduling with due-date windows

0.00 Avg rating0 Votes
Article ID: iaor20033143
Country: China
Volume: 17
Issue: 1
Start Page Number: 45
End Page Number: 49
Publication Date: Feb 2002
Journal: Journal of Systems Engineering and Electronics
Authors: , ,
Keywords: genetic algorithms
Abstract:

In this paper a hybrid genetic algorithm for solving the parallel machine scheduling problem with different due windows is proposed. An extended permutation-coding scheme is used to represent job partition and job permutation. A heuristic combining a priority rule with a best-fit rule is given to adjust the job sequence on each machine. The experimental results show that the algorithm is effective.

Reviews

Required fields are marked *. Your email address will not be published.