A hybrid genetic algorithm for the batch sequencing problem on identical parallel machines

The batch sequencing problem (BSP) has been the focus of much research thanks to its practical applicability and NP-hard nature. This study aims to solve an extension of the problem from single machine case to parallel machine case. A dispatching rule called the EDD (Earliest Due Date)-Greedy heuristic and a pure genetic algorithm (GA) are proposed, and then combine them through an insertion method called the Gene Bank Strategy. Several test cases of up to 12 machines and 60 jobs are randomly generated and solved. Those experiments show that the introduced hybrid GA can provide far better results than its two component algorithms that can also independently solve the problem.

Keywords:

• Parallel Machines
• Setup
• Genetic Algorithms