| dc.description.abstract | Train scheduling problem is an interesting topic to be discussed, since train has become such an important mass transportation in Indonesia. For that reason, this paper discusses how to solve a minimum cost scheduling problem (MCSP). The train scheduling problem that minimizes operation cost is formulated by MCSP in the form of integer programming. MCSP can be divided into two sections, i.e. minimum cost train problem (MCTP) and scheduling problem. In the first step, the right train is chosen with MCTP for a route, which satisfies a minimum cost. Furthermore, the next step solves the scheduling problem for the chosen train. The schedule is formulated only for one time period, which is assumed periodic. This solution is carried out by LINGO 11.0. The result gives the train scheduling for the specific route, which has minimum operation cost. | en |
