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.
[1]
Yoram Bresler,et al.
On the Optimality of the Backward Greedy Algorithm for the Subset Selection Problem
,
2000,
SIAM J. Matrix Anal. Appl..
[2]
Eugeniusz Nowicki,et al.
An Advanced Tabu Search Algorithm for the Job Shop Problem
,
2005,
J. Sched..
[3]
Lawrence Davis,et al.
Job Shop Scheduling with Genetic Algorithms
,
1985,
ICGA.
[4]
Luo Ya-bo.
An Analysis on the Correlation of Numerical Control Code Based on the Principle of Similarity
,
2006
.
[5]
Michael J. Shaw,et al.
Information-Based Dynamic Manufacturing System Scheduling
,
2001
.