Time-partitioning heuristic algorithm for optimal production, inventory, and transportation planning with direct shipment

Napaporn Rianthong; Aussadavut Dumrongsiri
May 2013
Songklanakarin Journal of Science & Technology;May/Jun2013, Vol. 35 Issue 3, p369
Academic Journal
We developed a mixed integer linear programming model for an integrated decision problem of production, inventory, and transportation planning. Our model combines the direct shipment into the production, inventory, and distribution planning. The objective was to minimize the total operation cost which is comprised of production setup cost, inventory holding cost, transportation cost, and reorder cost. The model is solved to optimality using the leading optimization software, IBM ILOG CPLEX (CPLEX), but the software shows a limited capability to solve large size problems. A time-partitioning heuristic algorithm is proposed to efficiently solve the problem. Numerical experiments are extensively conducted to test the proposed algorithm. In our numerical experiments, the proposed algorithm can solve many large size problems, whereas CPLEX fails to solve them. The numerical experiment shows that a company can gain a significant saving by optimally incorporating the direct shipment. The proposed heuristic algorithm performs well in most cases in terms of a total cost and the computation time.


Related Articles

  • Aggregate directional distance formulation of DEA with integer variables. Tan, Youchao; Shetty, Udaya; Diabat, Ali; Pakkala, T. // Annals of Operations Research;Dec2015, Vol. 235 Issue 1, p741 

    Conventional data envelopment analysis (DEA) models make the assumption of non-negativity and real values in the input and output of the systems that are under study. This paper combines these two interrelated ideas. One is the non-radial measurement of efficiency by establishing an aggregate...

  • A Relax-and-Fix Heuristic for a Production Planning Problem with Order Acceptance and Flexible Due Dates. Brahimi, N. // Proceedings of the International Conference on Industrial Engine;2014, p2303 

    We present a new production planning problem which integrates order acceptance decisions with due date flexibility while taking into consideration realistic production capacity constraints. The problem consists of choosing among a set of customer orders which ones to accept based on the profit...

  • Scheduling job families on non-identical parallel machines with time constraints. Obeid, Ali; Dauzère-Pérès, Stéphane; Yugma, Claude // Annals of Operations Research;Feb2014, Vol. 213 Issue 1, p221 

    This paper studies the scheduling of lots (jobs) of different product types (job family) on parallel machines, where not all machines are able to process all job families (non-identical machines). A special time constraint, associated to each job family, should be satisfied for a machine to...

  • A mathematical model and a heuristic approach for periodic material delivery in lean production environment. Kilic, Huseyin; Durmusoglu, Mehmet // International Journal of Advanced Manufacturing Technology;Nov2013, Vol. 69 Issue 5-8, p977 

    One of the important design elements for a good production system is material handling. In cases where it is not well-designed, it can be the bottleneck in the system. Moreover, it can cause a lot of wastes such as waiting time, idle time, and excessive transportation and cost. In this study,...

  • Two-stage flow-shop scheduling problem with non-identical second stage assembly machines. Navaei, J.; Ghomi, S. M. T. Fatemi; Jolai, F.; Shiraqai, M. E.; Hidaji, H. // International Journal of Advanced Manufacturing Technology;Dec2013, Vol. 69 Issue 9-12, p2215 

    This paper addresses the two-stage assembly flow-shop problem (TSAFP) with multiple non-identical assembly machines in second stage with the objective function of makespan minimization. This problem is a generalization of previously proposed problems in TSAFP. Mathematical mixed-integer linear...

  • An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem. Coco, Amadeu; Júnior, João; Noronha, Thiago; Santos, Andréa // Journal of Global Optimization;Oct2014, Vol. 60 Issue 2, p265 

    The well-known Shortest Path problem (SP) consists in finding a shortest path from a source to a destination such that the total cost is minimized. The SP models practical and theoretical problems. However, several shortest path applications rely on uncertain data. The Robust Shortest Path...

  • DIS-CARD: a new method of multiple criteria sorting to classes with desired cardinality. Kadziński, Miłosz; Słowiński, Roman // Journal of Global Optimization;Jul2013, Vol. 56 Issue 3, p1143 

    In this paper, we present a new preference disaggregation method for multiple criteria sorting problems, called DIS-CARD. Real-life experience indicates the need of considering decision making situations in which a decision maker (DM) specifies a desired number of alternatives to be assigned to...

  • Multi-objective location-transportation model in post-disaster relief operations. CHEN Gang; ZHANG Jin // Application Research of Computers / Jisuanji Yingyong Yanjiu;Mar2014, Vol. 31 Issue 3, p804 

    In order to distribute urgent relief to disaster areas quickly and accurately, this paper proposed a multi-period mixed integer programming model with the goals of minimizing the unsatisfied demands, total time and total cost, based on the periodic characteristics of urgent relief operations. It...

  • A VNS metaheuristic for solving the aircraft conflict detection and resolution problem by performing turn changes. Alonso-Ayuso, Antonio; Escudero, Laureano; Martín-Campo, F.; Mladenović, Nenad // Journal of Global Optimization;Nov2015, Vol. 63 Issue 3, p583 

    The aircraft Conflict Detection and Resolution (CDR) problem in air traffic management consists of finding a new configuration for a set of aircraft such that conflict situations between them are avoided. A conflict situation arises if two or more aircraft violate the safety distances that they...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics