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

An efficient approach to reduce search space of capacity planning for PWB assembly system: random demand

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

4 Author(s)
Zhongsheng Hua ; Sch. of Bus., Univ. of Sci. & Technol. of China, Hefei, China ; Liang Liang ; Qin Jin ; Chen Guoliang

An algorithm of determining the rough addition set for PWB assembly line capacity expansion problem under random demand is developed. For the single period problem, the algorithm can drop the size of integer decision variables dramatically and even to the extent that the corresponding problem can be directly solved by a standard integer programming code for realistic PWB assembly systems. The described algorithm can further help the heuristic search process or solving the procedure for the multiple-period problem

Published in:

Intelligent Control and Automation, 2000. Proceedings of the 3rd World Congress on  (Volume:3 )

Date of Conference:

2000

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.