Modeling the machine configuration and line-balancing problem of a PCB assembly line with modular placement machines

This paper studies the combined task of determining a favorable machine configuration and line balancing (MCLB) for an assembly line where a single type of printed circuit board is assembled by a set of interconnected, reconfigurable machine modules. The MCLB problem has been solved previously by he...

Full description

Saved in:
Bibliographic Details
Published in:International journal of advanced manufacturing technology 2011-04, Vol.54 (1-4), p.349-360
Main Authors: Rong, Aiying, Toth, Attila, Nevalainen, Olli S., Knuutila, Timo, Lahdelma, Risto
Format: Article
Language:English
Subjects:
Assembly lines
Balancing
CAE) and Design
Circuit boards
Computer-Aided Engineering (CAD
Configurations
Cycle time
Engineering
Evolutionary algorithms
Heuristic methods
Industrial and Production Engineering
Integer programming
Mechanical Engineering
Media Management
Modules
Original Article
Printed circuits
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper studies the combined task of determining a favorable machine configuration and line balancing (MCLB) for an assembly line where a single type of printed circuit board is assembled by a set of interconnected, reconfigurable machine modules. The MCLB problem has been solved previously by heuristic methods. In the present work, we give a mathematical formulation for it and transform the model into a linear integer programming model that can be solved using a standard solver for problems of moderate size. The model determines the best machine configuration and allocation of components to the machine modules with the objective of minimizing the cycle time. Because the solutions found in this way are globally optimal, they can be used to evaluate the efficiency of previous heuristics designed for the MCLB problem. In our experiments, an evolutionary algorithm gave near optimal results.
ISSN:0268-3768
1433-3015
DOI:10.1007/s00170-010-2920-z