A genetic algorithm for weighted single machine scheduling problems to maximize the whole-set orders

A genetic algorithm for weighted single machine scheduling problems to maximize the whole-set orders

0.00 Avg rating0 Votes
Article ID: iaor20071199
Country: China
Volume: 23
Issue: 5
Start Page Number: 22
End Page Number: 24
Publication Date: May 2005
Journal: Systems Engineering
Authors: ,
Keywords: heuristics: genetic algorithms, programming: integer
Abstract:

An actual single machine scheduling problem to maximize the number of whole-set orders was put forward. A 0–1 integer programming model was presented. An algorithm based on genetic algorithm is designed. An example was shown to illustrate the effectiveness of the algorithm.

Reviews

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