Journal of South China University of Technology (Natural Science Edition) ›› 2005, Vol. 33 ›› Issue (10): 108-111.
Previous Articles
Ding Wei
Received:
Online:
Published:
Contact:
About author:
Supported by:
国家自然科学基金资助项目(10371136);广东省自然科学基金资助项目(04009802);香港中文大学高等学术中心资助项目(05M2)
Abstract:
In order to overcome the dificulty in the sequencing of several groups of tasks,an improved longest processing time first(L )algorithm is proposed,and the Gmax problem of 4 groups of workpieces on one general-purpose machine and four special-purpose machines is investigated.In this investigation,the principles of“maximum relative machining time’’and“being disengaged first of all”are adopted and the four special-purpose machines are at the same speed.Then,by using the proposed approximate algorithm,the ratio of the approximate solution T to the optimal solution T* is evaluated,i.e.T/T*≤5/4,which means that the time cost with approximate sequencing is five fourths of that with optimal sequencing.
Key words: general-purpose machinery, special-purpose machinery , multi-group workpiece, sequencing, heuristic algorithm, performance index
Ding Wei. Sequencing of Four Groups of Workpieces on General-Purpose Machinery[J]. Journal of South China University of Technology (Natural Science Edition), 2005, 33(10): 108-111.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://zrb.bjb.scut.edu.cn/EN/
https://zrb.bjb.scut.edu.cn/EN/Y2005/V33/I10/108