Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests

Abstract

AbstractWe introduce a tactical resource allocation model for a large aerospace engine system manufacturer aimed at long‐term production planning. Our model identifies the routings a product takes through the factory, and which machines should be qualified for a balanced resource loading, to reduce product lead times. We prove some important mathematical properties of the model that are used to develop a heuristic providing a good initial feasible solution. We propose a tailored approach for our class of problems combining two well‐known criterion space search algorithms, the bi‐directional ε‐constraint method and the augmented weighted Tchebycheff method. A computational investigation comparing solution times for several solution methods is presented for 60 numerical instances.