Article ID: | iaor20013921 |
Country: | China |
Volume: | 21 |
Issue: | 1 |
Start Page Number: | 57 |
End Page Number: | 60 |
Publication Date: | Jan 2000 |
Journal: | Journal of Jiangsu University of Science and Technology |
Authors: | Li Yucheng, Shi Guohong, Yao Guangxin |
Keywords: | programming: dynamic |
Based on the demands of manufacture plan of GT machining unit, an optimum scheduling model is built up by means of two kinds of scheduling. Different methods are applied to the different scheduling according to their particular characteristics: a new inspiring method is applied to the scheduling of parts in a group based on R. Bellman rule, while for the scheduling of parts groups the scheduling problem is converted into the assignment problem before Hungary algorithm is adopted. This model proves to be an ideal solution to the scheduling of parts in GT machining unit.