Bi-objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests
Saved in:
| Title: | Bi-objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests |
|---|---|
| Authors: | Fotedar, Sunney, 1989, Strömberg, Ann-Brith, 1961, Almgren, Torgny, 1962 |
| Source: | Taktisk resursallokering för effektivt kapacitetsutnyttjande International Transactions in Operational Research. 30:3479-3507 |
| Subject Terms: | production planning, aerospace industry, capacity planning, bi-objective mixed integer programming (BOMIP) |
| Description: | 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 ε-constraint method and the augmented weighted Tchebycheff method. A computational investigation comparing solution times for several solution methods is presented for 60 numerical instances. |
| File Description: | electronic |
| Access URL: | https://research.chalmers.se/publication/531489 https://research.chalmers.se/publication/531489/file/531489_Fulltext.pdf |
| Database: | SwePub |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstract: | 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 ε-constraint method and the augmented weighted Tchebycheff method. A computational investigation comparing solution times for several solution methods is presented for 60 numerical instances. |
|---|---|
| ISSN: | 14753995 09696016 |
| DOI: | 10.1111/itor.13180 |