A review of discrete-time optimization models for tactical production planning

This is an Accepted Manuscript of an article published in International Journal of Production Research on 27 Mar 2014, available online: http://doi.org/10.1080/00207543.2014.899721[EN] This study presents a review of optimization models for tactical production planning. The objective of this research is to identify streams and future research directions in this field based on the different classification criteria proposed. The major findings indicate that: (1) the most popular production-planning area is master production scheduling with a big-bucket time-type period; (2) most of the considered limited resources correspond to productive resources and, to a lesser extent, to inventory capacities; (3) the consideration of backlogs, set-up times, parallel machines, overtime capacities and network-type multisite configuration stand out in terms of extensions; (4) the most widely used modelling approach is linear/integer/mixed integer linear programming solved with exact algorithms, such as branch-and-bound, in commercial MIP solvers; (5) CPLEX, C and its variants and Lindo/Lingo are the most popular development tools among solvers, programming languages and modelling languages, respectively; (6) most works perform numerical experiments with random created instances, while a small number of works were validated by real-world data from industrial firms, of which the most popular are sawmills, wood and furniture, automobile and semiconductors and electronic devices.This study has been funded by the Universitat Politècnica de València projects: ‘Material Requirement Planning Fourth Generation (MRPIV)’ (Ref. PAID-05-12) and ‘Quantitative Models for the Design of Socially Responsible Supply Chains under Uncertainty Conditions. Application of Solution Strategies based on Hybrid Metaheuristics’ (PAID-06-12).Díaz-Madroñero Boluda, FM.; Mula, J.; Peidro Payá, D. (2014). A review of discrete-time optimization models for tactical production planning. International Journal of Production Research. 52(17):5171-5205. doi:10.1080/00207543.2014.899721S51715205521

A Two-Echelon Location-inventory Model for a Multi-product Donation-demand Driven Industry

This study involves a joint bi-echelon location inventory model for a donation-demand driven industry in which Distribution Centers (DC) and retailers (R) exist. In this model, we confine the variables of interest to include; coverage radius, service level, and multiple products. Each retailer has two classes of product flowing to and from its assigned DC i.e. surpluses and deliveries. The proposed model determines the number of DCs, DC locations, and assignments of retailers to those DCs so that the total annual cost including: facility location costs, transportation costs, and inventory costs are minimized. Due to the complexity of problem, the proposed model structure allows for the relaxation of complicating terms in the objective function and the use of robust branch-and-bound heuristics to solve the non-linear, integer problem. We solve several numerical example problems and evaluate solution performance

Selection of return channels and recovery options for used products

Due to legal, economic and socio-environmental factors, reverse logistics practices and extended producer responsibility have developed into a necessity in many countries. The end results and expectations may differ, but the motivation remains the same. Two significant components in a reverse logistics system -product recovery options and return channels - are the focus of this thesis. The two main issues examined are allocation of the returned products to recovery options, and selection of the collection methods for product returns. The initial segment of this thesis involves the formulation of a linear programming model to determine the optimal allocation of returned products differing in quality to specific recovery options. This model paves the way for a study on the effects of flexibility on product recovery allocation. A computational example utilising experimental data was presented to demonstrate the viability of the proposed model. The results revealed that in comparison to a fixed match between product qualities and recovery options, the product recovery operation appeared to be more profitable with a flexible allocation. The second segment of this thesis addresses the methods employed for the initial collection of returned products. A mixed integer nonlinear programming model was developed to facilitate the selection of optimal collection methods for these products. This integrated model takes three different initial collection methods into consideration. The model is used to solve an illustrative example optimally. However, as the complexity of the issue renders this process ineffective in the face of larger problems, the Lagrangian relaxation method was proposed to generate feasible solutions within reasonable computational times. This method was put to the test and the results were found to be encouraging

Supply planning for a closed loop system with uncertain demand and return

This proposed model considers a supply network consisting of a manufacturer, its external suppliers, and a remanufacturing facility. The manufacturer, facing an uncertain market demand and return, has two options for supplying parts: either ordering the required parts to external suppliers or remanufacturing used products and bringing those back to \u27as new\u27 conditions. We propose a general framework for this multi product, closed loop system and develop a non-linear programming (NLP) model to maximize the total expected profit by optimally deciding quantity of parts to be remanufactured and quantity of parts to be purchased from external suppliers. We solved the mathematical model using two different solution techniques to find optimal or near optimal solution values. With a numerical example we compared the results from both solution techniques and introduced sensitivity analysis to illustrate the interacting effects among critical parameters in the model

Optimal production planning for a multi-product closed loop system with uncertain demand and return

We study the production planning problem for a multi-product closed loop system, in which the manufacturer has two channels for supplying products: producing brand-new products and remanufacturing returns into as-new ones. In the remanufacturing process, used products are bought back and remanufactured into as-new products which are sold together with the brand-new ones. The demands for all the products are uncertain, and their returns are uncertain and price-sensitive. The problem is to maximize the manufacturer\u27s expected profit by jointly determining the production quantities of brand-new products, the quantities of remanufactured products and the acquisition prices of the used products, subject to a capacity constraint. A mathematical model is presented to formulate the problem and a Lagrangian relaxation based approach is developed to solve the problem. Numerical examples are presented to illustrate the model and test the solution approach. Computational results show that the proposed approach is highly promising for solving the problems. The sensitivity analysis is also conducted to generate managerial insights

Supply chain network design for the diffusion of a new product

Supply Chain Network Design (SCND) deals with the determination of the physical configuration and infrastructures of the supply chain. Specifically, facility location is one of the most critical decisions: transportation, inventory and information sharing decisions can be readily re-optimized in response to changes in the context, while facility location is often fixed and difficult to change even in the medium term. On top of this, when designing a supply network to support a new product diffusion (NPD), the problem becomes both dynamic and stochastic. While literature concentrated on approaching SCND for NPD separately coping with dynamic and stochastic issues, we propose an integrated optimisation model, which allows warehouse positioning decisions in concert with the demand dynamics during the diffusion stage of an innovative product/service. A stochastic dynamic model, which integrates a Stochastic Bass Model (SBM) in order to better describe and capture demand dynamics, is presented. A myopic policy is elaborated in order to solve and validate on the data of a real case of SCND with 1,400 potential market points and 28 alternatives for logistics platforms