A SOLUTION TO SINGLE-MACHINE INVERSE JOB-SHOP SCHEDULING PROBLEM

摘要

Concerning the inverse job-shop scheduling problem (JSP), this paper proposes a hybrid solution based on genetic algorithm (GA) and improved particle swarm optimization (PSO), with the aim to minimize the parameter adjustment. The solution was presented as a block coding plan with decimal mechanism, under which both processes and parameters can be optimized simultaneously. To enhance the local search ability of the proposed algorithm, four neighbourhood structures were designed, and an adaptive selection mechanism was created to select the most suitable neighbourhood. Finally, the proposed algorithm was proved valid through discrete event simulation (DES) and comparison with other algorithms.