A genetic algorithm to minimize maximum lateness on a batch processing machine

A genetic algorithm to minimize maximum lateness on a batch processing machine

0.00 Avg rating0 Votes
Article ID: iaor2003197
Country: United Kingdom
Volume: 29
Issue: 12
Start Page Number: 1621
End Page Number: 1640
Publication Date: Oct 2002
Journal: Computers and Operations Research
Authors: ,
Keywords: heuristics, programming: dynamic
Abstract:

We consider the problem of minimizing maximum lateness on a batch processing machine in the presence of dynamic job arrivals. The batch processing machine can process up to B jobs simultaneously, and the processing time of a batch is given by that of the job with the longest processing time in the batch. We adapt a dynamic programming algorithm from the literature to determine whether a due-date feasible batching exists for a given job sequence. We then combine this algorithm with a random keys encoding scheme to develop a genetic algorithm for this problem. Computational experiments indicate that this algorithm has excellent average performance with reasonable computational burden.

Reviews

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