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

• We 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 epsilon-constraint method and the augmented weighted Tchebycheff method. A computational investigation comparing solution times for several solution methods is presented for 60 numerical instances.

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)

NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

NATURVETENSKAP  -- Matematik -- Beräkningsmatematik (hsv//swe)

NATURAL SCIENCES  -- Mathematics -- Computational Mathematics (hsv//eng)

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Datorsystem (hsv//swe)

ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Computer Systems (hsv//eng)

Nyckelord

bi-objective mixed integer programming (BOMIP)

production planning

aerospace industry

capacity planning

space search algorithm

criterion

Business & Economics

Operations Research & Management Science

production planning

Publikations- och innehållstyp

ref (ämneskategori)

art (ämneskategori)