Routi g and Production Schedulin g for a Mobil e Factory

In last decades, mobil e factories have been used due to their high production capability, carrying o ut their eq ipment, and covering rough and uneven routes. Nowadays, more companies use mobile factories w ith the a im of re ducing the transportation and manufactur ng costs. he mobile factory mu st travel between the suppliers, visit all of them in each time per od, and re turn to the initial location of the mobile fact ory. In this paper, we present an integer nonl inear programming m o del for pro uction sche duling and routing of m obile facto ry with the aim of maximization of profit. This problem is similar to the well-kn wn Traveling Salesma n Problem (TSP), which is an NP-hard probl em. In addit ion, for eac h supplier, the sched ling problem for production is NP-h ard. After linearizatio n, we proposed a h euristic gr eedy algo rithm. The efficiency of this he uristic alg orithm is analyzed using the computatio al studies on 540 randomly gen erated test instances. Finally, the sensitivity a nalysis of t he producti on, transpor tation, and relocation costs was conducted.

Keywords:

Mobile Fa tory , Routing , Production Scheduling Greedy Al gorithm