A triple objective function with a Chebychev dynamic pick-and-place point specification approach to optimise the surface mount placement machine

@article{Ayob2005ATO,
  title={A triple objective function with a Chebychev dynamic pick-and-place point specification approach to optimise the surface mount placement machine},
  author={Masri Ayob and Graham Kendall},
  journal={Eur. J. Oper. Res.},
  year={2005},
  volume={164},
  pages={609-626}
}

A nozzle selection heuristic to optimise the hybrid pick and place machine

  • M. AyobG. Kendall
  • Business
    IEEE Conference on Cybernetics and Intelligent Systems, 2004.
  • 2004
A constructive heuristic is presented to optimise the componentPick and place operations of a hybrid pick and place machine, which is a new type of surface mount device placement machine that gives highest priority to minimising the number of nozzle changes.

Setup Optimization in High-Mix Surface Mount PCB Assembly

This thesis discusses machine setup problems which arise in high-mix, lowvolume production environments of printed circuit board assembly (PCB) industry and develops heuristics methods that help to find near optimal solutions and sometimes even optimal solutions in an easy way.

The optimisation of the single surface mount device placement machine in printed circuit board assembly: a survey

The optimisation problem is classified into five sub-problems: feeder setup, component placement sequencing, nozzle optimisation, component retrieval plan and motion control, and issues relevant to each of these are analyzed.

PCB assembly optimization in a single gantry high-speed rotary-head collect-and-place machine

This paper presents an optimization study of the single gantry high-speed rotary-head collect-and-place (CAP) surface mount device (SMD) machine. The rotary-head gantry-type CAP machine has the

A note on a motion control problem for a placement machine

Assembling printed circuit boards efficiently using automated placement machines is a challenging task. Here, we focus on a motion control problem for a specific type of placement machines. More

Scheduling and Feeder Arrangement for Simultaneous Pickup in PCB Assembly

A new method for reducing assembly time in printed circuit board (PCB) assembly by prioritizing efficient simultaneous pickup operation of placement machines is proposed by using a random multistart local search.

PERFORMANCE OF A ROBOT TO REDUCE CYCLE TIME ESTIMATION BY C++ PROGRAMMING

The objective of this paper is to optimize the performance of a Cartesian (Gantry) robot to pick hot crown gear in a quenching press machine and to place the authors' Tray Track line pallate board by using endeffectors.

Clustering-Based Heuristic to Optimize Nozzle and Feeder Assignments for Collect-and-Place Assembly

A clustering-based heuristic, named average Chebyshev linkage directed search (ACLDS), to optimize the nozzle assignment, feeder assignment, and CAP sequence in a single spin-head gantry-type collect-and-place surface-mount technology machine.

References

SHOWING 1-10 OF 22 REFERENCES

A new dynamic point specification approach to optimise surface mount placement machine in printed circuit board assembly

  • M. AyobG. Kendall
  • Business
    2002 IEEE International Conference on Industrial Technology, 2002. IEEE ICIT '02.
  • 2002
Some factors that significantly contribute to the overall assembly efficiency of the placement machines are robot motion control, sequence of placement points and feeder setup. Many techniques have

A dynamic point specification approach to sequencing robot moves for PCB assembly

Abstract Reducing the time it lakes to place components on to printed circuit boards (PCBs) is a major robotic assembly objective. This paper explores a robot control approach featuring dynamic

Optimizing the performance of a surface mount placement machine

Process planning is an important and integral part of effectively operating a printed circuit board (PCB) assembly system. A PCB assembly system generally consists of different types of placement

Extended dynamic point specification approach to sequencing robot moves for PCB assembly

In PCB assembly planning, most of the current works solved the assembly sequence and feeder assignment problem directly. They have not decomposed the problem into subproblems. Consequently, the

Optimization of revolver head SMT machines using adaptive simulated annealing (ASA)

  • T. TirpakP. NelsonA. Asmani
  • Business
    Twenty Sixth IEEE/CPMT International Electronics Manufacturing Technology Symposium (Cat. No.00CH37146)
  • 2000
Among the various SMT assembly machines, revolver head machines are popular due to their small size, relatively high placement rate, wide range of parts they can place, and stationary feeder banks

A simulated annealing heuristic for robotics assembly using the dynamic pick-and-place model

Products assembled by robots are typical in present day manufacturing. The traditional type of automatic assembly is Fixed Picked and Place (FPP) mode. The development of the Dynamic Picked-and-Place

A Genetic Algorithms Enhanced Planning System for Surface Mount PCB Assembly

Printed circuit board (PCB) assembly forms the core of a vast array of contemporary manufactured products. The requirements for higher component densities on PCBs, rigid functional specifications,

Optimisation for surface mount placement machines

This paper will survey the relation between models, assembly machine technologies and heuristic methods in the context of surface mount placement machines.

Multiple criteria approach for solving feeder assignment and assembly sequence problem in PCB assembly

The feeder assignment and assembly sequence problem in printed circuit board (PCB) assembly with the twin objectives of minimizing magazine travel time and minimizing board travel time is presented

Optimization of high-speed multistation SMT placement machines using evolutionary algorithms

Experimental results using genetic algorithms to optimize the feeder slot assignment problem for a high-speed parallel, multistation SMT placement machine are presented, which supports the use of genetic algorithms for this problem.