a joint scheduling of production and distribution operations in a flow shop manufacturing system

In traditional scheduling problems and in many realworld applications the production operations are scheduled regardless of distribution decisions. indeed, the completion time of a job in such problems is traditionally defined as the time when the production sequences of a job are finished. however, in many practical environments completed orders are delivered to customers immediately after production stages without any further inventory storage. therefore, in this paper, we investigate an integrated scheduling model of production and distribution problems simultaneously. it is assumed that products are proceed through a permutation flow shop scheduling manufacturing system and delivered to customers via available vehicles. the objective in our integrated model is to minimize maximum returning time (mrt), which is the time that last vehicle delivers last order to relevant customer and returns to production center. the problem formulated mathematically, and then an improved imperialist competitive algorithm (iica) is proposed for solving it. furthermore, sufficient numbers of test problems are generated for computational study. various parameters of the algorithm are analyzed to calibrate the algorithm by means of the taguchi method. at the end, the effectiveness of the proposed model and suggested algorithm is evaluated through a computational study where obtained results show the appropriate performance of integrated model and solving approach in comparison to those of the other algorithms.