Feasible batch scheduling problem and its genetic algorithm

Feasible batch scheduling problem and its genetic algorithm

0.00 Avg rating0 Votes
Article ID: iaor20013935
Country: China
Volume: 20
Issue: 5
Start Page Number: 70
End Page Number: 75
Publication Date: May 2000
Journal: Systems Engineering Theory & Practice
Authors: , ,
Keywords: batching, genetic algorithms
Abstract:

A discrimination problem, i.e., whether there exists a schedule in which all demands can be satisfied in time, is studied. Its equivalent feasible batch scheduling problem (FBSP) is obtained. By analyzing the features of the FBSP, the solutions to the batch scheduling problem are represented in binary codes naturally. Based on it, a genetic algorithm, which can overcome the drawback of permutation-based GA that is often used in scheduling, is presented. Computational results show the effectiveness of the algorithm.

Reviews

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