Graham Kendall
Various Images

Professor Graham Kendall

Professor Graham Kendall is the Provost and CEO of The University of Nottingham Malaysia Campus (UNMC). He is also a Pro-Vice Chancellor of the University of Nottingham.

He is a Director of MyResearch Sdn Bhd, Crops for the Future Sdn Bhd. and Nottingham Green Technologies Sdn Bhd. He is a Fellow of the British Computer Society (FBCS) and a Fellow of the Operational Research Society (FORS).

He has published over 230 peer reviewed papers. He is an Associate Editor of 10 journals and the Editor-in-Chief of the IEEE Transactions of Computational Intelligence and AI in Games.

News

If you are interested in hyper-heuristics, take a look at my publications in this area
http://bit.ly/efxLGg
I am involved with a spin out company that specialises in Strategic Resource Planning
http://bit.ly/eTPZO2

Latest Blog Post

How Isaac Newton could help you beat the casino at roulette

Random Blog Post

Learning Java, the first steps

Publication(s)

Guided Operators for a Hyper-Heuristic Genetic Algorithm
http://bit.ly/hd4Erh
Hyper-heuristics: a survey of the state of the art
http://bit.ly/1eSDAeb
Introducing Individual and Social Learning Into Evolutionary Checkers
http://bit.ly/1a2YwLx
Evolving Neural Networks with Evolutionary Strategies: A New Application to Divisa Money
http://bit.ly/dKzEAy

Graham Kendall: Details of Requested Publication


Citation

Ayob, M and Kendall, G Real-time Scheduling for Multi Headed Placement Machine. In Proceedings of the 2003 IEEE International Symposium on Assembly and Task Planning (ISATP2003) (ISATP 2003), pages 128-133, Besancom, France, 9-11 July 2003, 2003.


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.


pdf

You can download the pdf of this publication from here


doi

The doi for this publication is 10.1109/ISATP.2003.1217199 You can link directly to the original paper, via the doi, from here

What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information



URL

The URL for additional information is 10.1109/ISATP.2003.1217173

The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.


Bibtex

@INPROCEEDINGS{ak2003b, author = {M. Ayob and G. Kendall},
title = {Real-time Scheduling for Multi Headed Placement Machine},
booktitle = {Proceedings of the 2003 IEEE International Symposium on Assembly and Task Planning (ISATP2003) (ISATP 2003)},
year = {2003},
pages = {128--133},
address = {Besancom, France, 9-11 July 2003},
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.},
comment = {ISBN 0-7803-7770-2},
doi = {10.1109/ISATP.2003.1217199},
keywords = {component placement, printed circuit board assembly, real time, scheduling, surface mount device, PCB},
timestamp = {2007.03.29},
url = {10.1109/ISATP.2003.1217173},
webpdf = {http://www.graham-kendall.com/papers/ak2003b.pdf} }