• 한국정밀공학회지
• /
• 제12권6호
• /
• pp.27-36
• /
• 1995

This paper covers algorithms to determine a machine assignment strategy to locations on a single straight track by minimizing the total backtrack distance. Three different algorithms ar presented: an efficient heuristic procedure, the branch-and-bound algorithm, and the nerual network approach. Simulation results show that the proposed algorithms have potential power to design an on-line optimizer.