By Topic

Schedule Optimization for NC Resource Sharing Based-on Greed Algorithm and Tabu Search

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)
Ling He ; Sch. of Mech. & Electron. Eng., Wuhan Univ. of Technol., Wuhan, China ; Luo Yabo ; Lu Hong

Optimal schedule for production aims to maximize the efficiency of the operation and reduce costs. This paper focuses on the flexibility and stability of scheduling algorithm in the NC machine tools sharing over Internet. A novel scheduling algorithm is detailed proposed by integrating advantages of the greed algorithm and tabu search for the share-oriented NC tasks scheduling problem. The characteristic of share-oriented NC tasks are analyzed, and then the result of correlated analysis is applied to establish the model of NC tasks scheduling. The construction and steps of algorithm have been represented. Experimental results show that the proposed algorithm provides faster speed of searching and higher stability than other existing algorithm and demonstrates the feasibility and effectiveness of the novel methodology.

Published in:

Intelligent Computation Technology and Automation, 2009. ICICTA '09. Second International Conference on  (Volume:3 )

Date of Conference:

10-11 Oct. 2009