Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2209.09116 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929655110434816 |
|---|---|
| author | Chauhan, Vinod Kumar Bass, Mark Parlikad, Ajith Kumar Brintrup, Alexandra |
| author_facet | Chauhan, Vinod Kumar Bass, Mark Parlikad, Ajith Kumar Brintrup, Alexandra |
| contents | A trolley is a container for loading printed circuit board (PCB) components, and a trolley optimisation problem (TOP) is an assignment of PCB components to trolleys for use in the production of a set of PCBs in an assembly line. In this paper, we introduce the TOP, a novel operation research application. To formulate the TOP, we derive a novel extension of the bin packing problem. We exploit the problem structure to decompose the TOP into two smaller, identical, and independent problems. Further, we develop a mixed integer linear programming model to solve the TOP and prove that the TOP is an NP-complete problem. A case study of an aerospace manufacturing company is used to illustrate the TOP which successfully automated the manual process in the company and resulted in significant cost reductions and flexibility in the building process. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2209_09116 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Trolley Optimisation for Loading Printed Circuit Board Components Chauhan, Vinod Kumar Bass, Mark Parlikad, Ajith Kumar Brintrup, Alexandra Computational Engineering, Finance, and Science Optimization and Control A trolley is a container for loading printed circuit board (PCB) components, and a trolley optimisation problem (TOP) is an assignment of PCB components to trolleys for use in the production of a set of PCBs in an assembly line. In this paper, we introduce the TOP, a novel operation research application. To formulate the TOP, we derive a novel extension of the bin packing problem. We exploit the problem structure to decompose the TOP into two smaller, identical, and independent problems. Further, we develop a mixed integer linear programming model to solve the TOP and prove that the TOP is an NP-complete problem. A case study of an aerospace manufacturing company is used to illustrate the TOP which successfully automated the manual process in the company and resulted in significant cost reductions and flexibility in the building process. |
| title | Trolley Optimisation for Loading Printed Circuit Board Components |
| topic | Computational Engineering, Finance, and Science Optimization and Control |
| url | https://arxiv.org/abs/2209.09116 |