en Production Planning & Control Production Planning & Control پژوهشي Research <p style="margin-left: 1.2in;"><em>In last decades, mobile factories have been used due to their high production capability, carrying 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 </em><em>an integer </em><em>nonlinear programming model</em><em> for production scheduling and routing of mobile factory</em><em> with the aim of maximization of profit</em><em>. This problem is similar to the well-known Traveling Salesman Problem (TSP) which is an NP-hard problem.</em><em> Also at each supplier, the scheduling problem for production is NP-hard</em><em>. </em><em>After linearization,</em> <em>we proposed a heuristic greedy algorithm. The efficiency of this heuristic algorithm is analyzed using the computational studies on 540 randomly generated test instances.</em><em> Finally, the sensitivity analysis of the production cost, transportation cost and relocation cost was conducted.</em></p> Mobile Factory, Routing, Production Scheduling, Greedy Algorithm. 299 308 http://ijiepr.iust.ac.ir/browse.php?a_code=A-10-1034-1&slc_lang=en&sid=1 Adeleh Behzad behzad.adele@mail.um.ac.ir 180031947532846004509 180031947532846004509 No Industrial Engineering Department, Faculty of Engineering, Ferdowsi University of Mashhad, Mashhad, Iran Mohammadali Pirayesh pirayesh@um.ac.ir 180031947532846004510 180031947532846004510 Yes Industrial Engineering Department, Faculty of Engineering, Ferdowsi University of Mashhad, Mashhad, Iran Mohammad Ranjbar m_ranjbar@um.ac.ir 180031947532846004511 180031947532846004511 No Industrial Engineering Department, Faculty of Engineering, Ferdowsi University of Mashhad, Mashhad, Iran