This work intends to contribute to the planning guidelines in the field of Supply Chain Management (SCM). Thus, it develops a multi-model proposal supported by the definition of a highly complex spectrum of knowledge that considers a sequence of systematic procedures in the following phases –...

En este trabajo se presenta un modelo de programación matemática fuzzy multiobjetivo para la planificación del transporte a nivel operativo en una cadena de suministro. Los objetivos del modelo propuesto son la minimización del número de camiones utilizados y del inventario total,...

Supply chain demand forecast and inventory purchase planning are essential business operations to many businesses. In this paper, we discuss the strategies and techniques in the supply chain demand forecast and inventory purchase planning for small businesses from practitioner's perspective. The...

A new fuzzy mathematical programming model for supply chain planning under supply, process and demand uncertainty is proposed in this paper. A tactical supply chain planning problem has been formulated as a fuzzy mixed integer linear programming model where data are ill-known and modeled by...

Increasing awareness of the ecological impacts of industrial growth, resource scarcity as well as changing consumption patterns, has led to the growth of sustainability issues in supply chain practices. The purpose of this paper is to highlight a few areas of possible importance in planning,...

In this paper, we analyze a variety of approaches to obtain lower bounds for multi-level production planning problems with big bucket capacities, i.e., problems in which multiple items compete for the same resources. We give an extensive survey of both known and new methods, and also establish...

Although the Lagrangian method is a powerful dual search method in integer programming, it often fail to identify the optimal solution of the primal problem. In this paper, a quasi dual formulation is proposed for bounded integer programming. This formulation possesses an asymptotic strong...

We present a two-phase heuristic for designing a capacitated degree constrained min sum arborescence. For a given directed graph G(V,E) where V={0, 1,…,n} with nonnegative costs Cij for each (i,j)

The clique partitioning problem is an NP-hard combinatorial optimization problem with applications to data analysis such as clustering. Though a binary integer linear programming formulation has been known for years, one needs to deal with a huge number of variables and constraints when solving...

In this paper we propose a 4-index formulation for the uncapacitated multiple allocation hub location problem tailored for urban transport and liner shipping network design. This formulation is very tight and most of the tractable instances for MIP solvers are optimally solvable at the root...