Routing and Production Scheduling for a Mobile Factory

In last decades, mobile factories have been used due to their high production capability, carrying out their equipment, and covering rough and uneven routes. nowadays, more companies use mobile factories with the aim of reducing the transportation and manufacturing costs. the mobile factory must travel between the suppliers, visit all of them in each time period, and return to the initial location of the mobile factory. in this paper, we present an integer nonlinear programming model for production scheduling and routing of mobile factory with the aim of maximization ofprofit. this problem is similar to the well-known traveling salesman problem (tsp), which is an np-hard problem. in addition, for each supplier, the scheduling problem for production is np-hard. after linearization, we proposed a heuristic greedy algorithm. the efficiency of this heuristic algorithm is analyzed using the computational studies on 540 randomly generated test instances. finally, the sensitivity analysis of the production, transportation, and relocation costs was conducted.