This paper studies a production planning problem in printed circuit board (PCB) assembly. A PCB assembly line has several non-identical placement machines, so the placement times by different machines are various to the same type of components. Several mathematical models are formulated in order to obtain a best assignment of components to machines with the objective of minimizing the cycle time to have the best line throughput. Moreover, the data structures of the models are analyzed and compared with other similar models to search a good available algorithm. Finally, a numerical example is provided to illustrate these models and is solved by a computer package.
- Printed circuit boards
- Production planning
ASJC Scopus subject areas
- Control and Systems Engineering
- Industrial and Manufacturing Engineering