The Optimal Scheduling for PCB Flexible Assembling Automation

Shi Gang Wang; Feng Juan Wang; Yu Juan Wang

doi:10.4028/www.scientific.net/AMM.151.175

Paper Titles

Research on Web-Based Elastohydrodynamic Lubrication Oil Theory of Rolling Bearing Type Planetary Friction Transmission Mechanism
p.155

Strength and Mode Analysis of Testing Machine of 3MW Wind Turbine Bearing with Finite Element Method
p.160

Estimation of Vehicle Pre-Braking Speed
p.165

A Novel MEMS CPW Structure
p.170

The Optimal Scheduling for PCB Flexible Assembling Automation
p.175

Study on Hot Roll Profile in the Initial Stage of Twin-Roll Continuous Strip Casting
p.179

Design and Implementation of Fuzzy Based Person Following Mobile Robot
p.184

Simulation of Dynamic Behavior of Slider at Head/Disk Interface of Hard Disk Drives
p.189

Analysis in Y Direction Reamer Error Based on Aspheric Parallel Grinding
p.193

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 151The Optimal Scheduling for PCB Flexible Assembling...

The Optimal Scheduling for PCB Flexible Assembling Automation

Abstract:

For improve the efficiency of the automation, the optimal scheduling problem in a PCB flexible assembling automation is studied. Automation within the system has flexibilities, so some assembly operations can be handled by different automation and assembling time can different. Based on this sort of assembling automation, the minimum balance algorithm is presented in this paper, and an example demonstrates its effectiveness.

You might also be interested in these eBooks

New Trends in Mechatronics and Materials Engineering

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 151)

Pages:

175-178

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.151.175

Citation:

Cite this paper

Online since:

January 2012

Authors:

Shi Gang Wang, Feng Juan Wang, Yu Juan Wang

Keywords:

Flexible Assembling Automation, Optimal Scheduling, PCB

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Cheng-Dong Wu, Ying Zhang, Meng-Xin Li: A rough set GA-based hybrid method for robot path planning. International Journal of Automation and Computing, No. 1 (2006), pp.29-34.

DOI: 10.1007/s11633-006-0029-5

Google Scholar

[2] Oded Z. Maimon and Stanley B. Gershwin: Dynamic scheduling and routing for flexible manufacturing systems that have unrealible machines. Operations Research, Vol. 36 (1988), pp.279-292.

DOI: 10.1287/opre.36.2.279

Google Scholar

[3] Shen Bin, Zhou Yingjun, Wang Jiahai: Research of job shop scheduling problem based on self-adaptive genetic algorithm. ournal of Computer Applications, Vol. 29, No. S2 (2009), pp.161-164.

Google Scholar

[4] Cheng Zhenmin, Zhang Xijuan, Li Hongxing: Two parallel machines scheduling with periodic maintenance to minimize makespan. Mathematica Applicata, Vol. 23, No. 1 (2010), pp.1-6.

Google Scholar

[5] J. D Ullman: Complexity of sequencing problem. Computer and Job/Shop Scheduling Theory, New York, (1976).

Google Scholar