This paper focuses on an arc-welding robot scheduling problem, which is the problem of determining the sequence of welding operations while avoiding heat-caused distortion for the objective of minimizing the time required to complete a given set of welding operations. Each welding operation is specified by a weld line with two end points, each of which can be a possible starting point of the welding operation for that weld line. Because of the heat-caused distortion, there must be a certain period of time (delay) between welding operations associated with weld lines near each other. We develop several heuristic algorithms, in which heuristics for the travelling salesman problem are modified to cope with characteristics of the problem considered here. To show the performance of the heuristics suggested in this paper, computational experiments are performed on a number of randomly generated test problems and results are reported.