Network Moving Train scheduling as an application of Job Shop Scheduling Problem

Job Shop Scheduling Problem has been one of the most interesting research topics during the last few years. JSS problem has been studied in different forms of Deterministic, Fuzzy, and Stochastic at varied depths. Further to the classical JSP, some other type of job shop problem like flexible JSP, JSP with controllable processing times, JSP with blocking, no-store, or limited storage capacity constraints, have been introduced. In addition many different types of solving approaches exhibited in related literature. Beside JSP, Train Scheduling Problem is in favor of many researchers. One approach to solve the TSP is to model it as a JSP. In this paper first it is show how a complicated TSP can rewrite as a JSP one, then we modify the formulation of classical job shop problem in order to utilize it to formulate a network railway train-scheduling problem. By embedding fuel consumption minimization as the second objective and benefiting lexicography method, the appeared Multi Objective Decision Making TSP with an interesting example is solved

Network Moving Train scheduling as an application of Job Shop Scheduling Problem Keywords:

Job Shop Scheduling , Railway Network , Train Scheduling , Integer Programming , lexicography