Real-time scheduling for multi headed placement machine

Masri Ayob, Graham Kendall

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

Abstract

This paper proposes a methodology for real-time scheduling to sequence the pickup and placement of component on multi headed placement machines in printed circuit board (PCB) assembly. The latest technology of surface mount device (SMD) placement machines have a smart feeder carrier that automatically identifies the exact location of each component type on the feeder slot, detects component's missing from the component feeders (and continues working with other component types) and allows a component to be reloaded during a pick and place operation without stopping the operation. Assuming that the components on the feeder carrier may be misplaced or some of the required components are missing, we generate an initial schedule using a greedy constructive heuristic by only considering the available placement points. The initial solution can immediately be used to assemble components for the first PCB. While the placement machine is assembling components, we employ the CPU free time (whilst the robot arm is moving) to improve the initial schedule by using a randomised hill climbing search technique. Thus, the subsequent PCB's will use the improved schedule. Our experimental result on two data sets show that we gain 58.79% and 76.69% (respectively) improvement on assembly cycle time over the initial schedule.

Original languageEnglish
Title of host publicationProceedings of the IEEE International Symposium on Assembly and Task Planning
PublisherIEEE Computer Society
Pages128-133
Number of pages6
Volume2003-January
ISBN (Print)0780377702
DOIs
Publication statusPublished - 2003
Externally publishedYes
Event5th IEEE International Symposium on Assembly and Task Planning, ISATP 2003 - Besancon, France
Duration: 10 Jul 200311 Jul 2003

Other

Other5th IEEE International Symposium on Assembly and Task Planning, ISATP 2003
CountryFrance
CityBesancon
Period10/7/0311/7/03

Fingerprint

Printed circuit boards
Scheduling
Pickups
Polychlorinated biphenyls
Program processors
Robots

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering
  • Industrial and Manufacturing Engineering
  • Computer Science Applications

Cite this

Ayob, M., & Kendall, G. (2003). Real-time scheduling for multi headed placement machine. In Proceedings of the IEEE International Symposium on Assembly and Task Planning (Vol. 2003-January, pp. 128-133). [1217199] IEEE Computer Society. https://doi.org/10.1109/ISATP.2003.1217199

Real-time scheduling for multi headed placement machine. / Ayob, Masri; Kendall, Graham.

Proceedings of the IEEE International Symposium on Assembly and Task Planning. Vol. 2003-January IEEE Computer Society, 2003. p. 128-133 1217199.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ayob, M & Kendall, G 2003, Real-time scheduling for multi headed placement machine. in Proceedings of the IEEE International Symposium on Assembly and Task Planning. vol. 2003-January, 1217199, IEEE Computer Society, pp. 128-133, 5th IEEE International Symposium on Assembly and Task Planning, ISATP 2003, Besancon, France, 10/7/03. https://doi.org/10.1109/ISATP.2003.1217199
Ayob M, Kendall G. Real-time scheduling for multi headed placement machine. In Proceedings of the IEEE International Symposium on Assembly and Task Planning. Vol. 2003-January. IEEE Computer Society. 2003. p. 128-133. 1217199 https://doi.org/10.1109/ISATP.2003.1217199
Ayob, Masri ; Kendall, Graham. / Real-time scheduling for multi headed placement machine. Proceedings of the IEEE International Symposium on Assembly and Task Planning. Vol. 2003-January IEEE Computer Society, 2003. pp. 128-133
@inproceedings{a69a8462a6fa4c79b1a85931e848b037,
title = "Real-time scheduling for multi headed placement machine",
abstract = "This paper proposes a methodology for real-time scheduling to sequence the pickup and placement of component on multi headed placement machines in printed circuit board (PCB) assembly. The latest technology of surface mount device (SMD) placement machines have a smart feeder carrier that automatically identifies the exact location of each component type on the feeder slot, detects component's missing from the component feeders (and continues working with other component types) and allows a component to be reloaded during a pick and place operation without stopping the operation. Assuming that the components on the feeder carrier may be misplaced or some of the required components are missing, we generate an initial schedule using a greedy constructive heuristic by only considering the available placement points. The initial solution can immediately be used to assemble components for the first PCB. While the placement machine is assembling components, we employ the CPU free time (whilst the robot arm is moving) to improve the initial schedule by using a randomised hill climbing search technique. Thus, the subsequent PCB's will use the improved schedule. Our experimental result on two data sets show that we gain 58.79{\%} and 76.69{\%} (respectively) improvement on assembly cycle time over the initial schedule.",
author = "Masri Ayob and Graham Kendall",
year = "2003",
doi = "10.1109/ISATP.2003.1217199",
language = "English",
isbn = "0780377702",
volume = "2003-January",
pages = "128--133",
booktitle = "Proceedings of the IEEE International Symposium on Assembly and Task Planning",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Real-time scheduling for multi headed placement machine

AU - Ayob, Masri

AU - Kendall, Graham

PY - 2003

Y1 - 2003

N2 - This paper proposes a methodology for real-time scheduling to sequence the pickup and placement of component on multi headed placement machines in printed circuit board (PCB) assembly. The latest technology of surface mount device (SMD) placement machines have a smart feeder carrier that automatically identifies the exact location of each component type on the feeder slot, detects component's missing from the component feeders (and continues working with other component types) and allows a component to be reloaded during a pick and place operation without stopping the operation. Assuming that the components on the feeder carrier may be misplaced or some of the required components are missing, we generate an initial schedule using a greedy constructive heuristic by only considering the available placement points. The initial solution can immediately be used to assemble components for the first PCB. While the placement machine is assembling components, we employ the CPU free time (whilst the robot arm is moving) to improve the initial schedule by using a randomised hill climbing search technique. Thus, the subsequent PCB's will use the improved schedule. Our experimental result on two data sets show that we gain 58.79% and 76.69% (respectively) improvement on assembly cycle time over the initial schedule.

AB - This paper proposes a methodology for real-time scheduling to sequence the pickup and placement of component on multi headed placement machines in printed circuit board (PCB) assembly. The latest technology of surface mount device (SMD) placement machines have a smart feeder carrier that automatically identifies the exact location of each component type on the feeder slot, detects component's missing from the component feeders (and continues working with other component types) and allows a component to be reloaded during a pick and place operation without stopping the operation. Assuming that the components on the feeder carrier may be misplaced or some of the required components are missing, we generate an initial schedule using a greedy constructive heuristic by only considering the available placement points. The initial solution can immediately be used to assemble components for the first PCB. While the placement machine is assembling components, we employ the CPU free time (whilst the robot arm is moving) to improve the initial schedule by using a randomised hill climbing search technique. Thus, the subsequent PCB's will use the improved schedule. Our experimental result on two data sets show that we gain 58.79% and 76.69% (respectively) improvement on assembly cycle time over the initial schedule.

UR - http://www.scopus.com/inward/record.url?scp=84942525672&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84942525672&partnerID=8YFLogxK

U2 - 10.1109/ISATP.2003.1217199

DO - 10.1109/ISATP.2003.1217199

M3 - Conference contribution

AN - SCOPUS:84942525672

SN - 0780377702

VL - 2003-January

SP - 128

EP - 133

BT - Proceedings of the IEEE International Symposium on Assembly and Task Planning

PB - IEEE Computer Society

ER -