Solving a production line scheduling problem with identical parallel machines with a special procedure constraint by means of a genetic algorithm

Solving a production line scheduling problem with identical parallel machines with a special procedure constraint by means of a genetic algorithm

0.00 Avg rating0 Votes
Article ID: iaor20023579
Country: China
Volume: 27
Issue: 3
Start Page Number: 381
End Page Number: 386
Publication Date: May 2001
Journal: Acta Automatica Sinica
Authors: , ,
Keywords: genetic algorithms
Abstract:

The scheduling objective is to minimize the total cost of makespan, tardy time and overstock time, and a genetic algorithm (GA) is presented for optimizing the schedule. The research describes aspects of the GA such as problem modeling, coding, crossover and mutation.

Reviews

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