Enhanced grouping league championship and optics inspired optimization algorithms for scheduling a batch processing machine with job conflicts and non-identical job sizes

摘要

This research aims to address scheduling of a single batch processing machine, where jobs are in different sizes and have a conflicting nature with each other, in the sense that two conflicting jobs cannot share the same batch and hence, cannot be processed simultaneously by the machine. The problem is referred to as SBMC. After formulating the problem, a strong lower bound procedure is developed by transforming a relaxed version of the scheduling problem to the multiple bottleneck transportation problem (MTP) with conflicts. An efficient Lagrangian relaxation procedure is proposed, which takes advantage of decomposable nature of the relaxed problem, to attain a lower bound for MTP which in essence is a lower bound for SBMC. To solve the problem, two metaheuristic algorithms, namely the League Championship Algorithm (LCA) and Optic Inspired Optimization (010), are adapted and fundamentally modified to match the problem unique structure (i.e., the grouping structure) and accordingly the grouping version of these algorithms is developed. The effectiveness of the lower bound procedure, as well as algorithms, are evaluated through extensive computational experiments. To show they perform efficiently in running times and effective in finding near-optimal bounds for most of the problem instances, we generate 20 different classes of problems according to variability in job sizes, number of jobs and density of incompatibility matrix. Then, we make comparison with two of extensively used algorithms from literature, SA and GA. Our proposed algorithms obtain solutions with objective values less than 6% gap from the lower bound and outperform SA and GA algorithms, especially for large instances. Moreover, values of the lower bound procedure lie within less than 4% of objective values provided by CPLEX. (C) 2019 Elsevier B.V. All rights reserved.