In this paper, we deals with a torpedo car scheduling problem as an example of practical problems. To the problem, first, we propose a way of making an integer programming model, which makes it possible to adopt mathematical programming packages and to obtain the optimal schedule. Then, through some computational experiments, the potential and effectiveness of finding the optimal (or near optimal) schedule have been investigated.
