Cart (Loading....) | Create Account
Close category search window
 

Increasing throughput for robotic cells with parallel Machines and multiple robots

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Geismar, H.N. ; Univ. of Texas, Dallas, TX, USA ; Sriskandarajah, C. ; Ramanan, N.

We address the problem of scheduling robots' moves in a robotic cell that is used by a Dallas-area semiconductor equipment manufacturer. The cell has parallel machines, multiple robots, and Euclidean travel times. We describe a plan of operation that allows the robots to operate concurrently, efficiently, and with no risk of colliding. We propose a set of sequences of robot moves, analytically determine this scheme's throughput, and determine problem instances for which it is optimal. Through simulation, we demonstrate that our scheme is superior to the heuristic dispatching rule currently in use by the manufacturer.

Note to Practitioners-Efficient scheduling of a robotic cell can greatly increase productivity and revenue for manufacturers in many different industries. This increase becomes more pronounced for larger cells that employ multiple robots and parallel machines at various production stages. This paper describes a schedule of robotic actions that is optimal under a common set of conditions for such large cells, in addition to many other types of cells. When this set of conditions does not hold, even though optimality could not be proven, this schedule is shown to be superior to one currently in use by some semiconductor manufacturers. We also present a scheme that allows the robots to operate concurrently, efficiently, and with no risk of colliding. Additionally, an approximation to the improvement in revenues realized by using this schedule is provided.

Published in:

Automation Science and Engineering, IEEE Transactions on  (Volume:1 ,  Issue: 1 )

Date of Publication:

Jul 2004

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.