Genetic Algorithms with Simulation for a Job Shop Scheduling Problem with Crane Conveyance

摘要

In this paper, a genetic algorithm (GA) and GA with diversification generator (DG) for solving scheduling problems with crane conveyance are proposed. It becomes very difficult to obtain an optimum or near optimum schedule under consideration of restrictions to avoid crane interference in addition to many restrictions on operation of each machine. GA-based algorithms are applied to obtain high quality crane assignment which successfully leads to few working hour delays caused by crane interference. Effectiveness of this algorithm is confirmed by numerical experiments.