An adaptive shuffled frog-leaping algorithm for parallel batch processing machines scheduling with machine eligibility in fabric dyeing process

Fabric dyeing is an important production process in clothing industry and consists of some batch processing machines (BPM). In this study, parallel BPM scheduling problem with machine eligibility in fabric dyeing process is considered and an adaptive shuffled frog-leaping algorithm (ASFLA) is presented to minimise makespan and total tardiness simultaneously. A heuristic is used to produce initial population. Evolution quality of population on the last generation is used to implement adaptive population division and adaptive search process in each memeplex on the current generation. Search process of each memeplex is divided into some segments and search operators are dynamically adjusted after each segment is done. Adaptive elimination is performed on the worst memeplex. Extensive experiments are conducted to test the performance of ASFLA and the computational results demonstrate that new strategies of ASFLA are effective and ASFLA has promising advantages on the considered problem.