Referenced Items are not available for this document.
We introduce a mixed-integer programming formulation for finding optimal cyclic schedules for printed circuit board lines with multiple hoists on a shared track, where the processing sequence may be different than the location sequence of the tanks. Computational results on some benchmark problems indicate that optimal cyclic schedules for problems of realistic size can be found in a reasonable time.
Published in:
Robotics and Automation, IEEE Transactions on
(Volume:19
,
Issue:
3
)
Date of Publication: June 2003
- Page(s):
- 480 - 484
- ISSN :
- 1042-296X
- INSPEC Accession Number:
- 7683671
- Digital Object Identifier :
- 10.1109/TRA.2003.810240
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 25 June 2003
- Issue Date :
- June 2003
- Sponsored by :
- IEEE Robotics and Automation Society
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
