A Multi-Level Ga Search With Application To The Resource-Constrained Re-Entrant Flow Shop Scheduling Problem

Danping Lin, C.K.M. Lee
2012 Zenodo  
Re-entrant scheduling is an important search problem with many constraints in the flow shop. In the literature, a number of approaches have been investigated from exact methods to meta-heuristics. This paper presents a genetic algorithm that encodes the problem as multi-level chromosomes to reflect the dependent relationship of the re-entrant possibility and resource consumption. The novel encoding way conserves the intact information of the data and fastens the convergence to the near optimal
more » ... olutions. To test the effectiveness of the method, it has been applied to the resource-constrained re-entrant flow shop scheduling problem. Computational results show that the proposed GA performs better than the simulated annealing algorithm in the measure of the makespan
doi:10.5281/zenodo.1076369 fatcat:52vfnacyqjhavaimbebjx7rgua