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,...

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...

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...

Dynamic pricing has become a common form of electricity tariff, where the price of electricity varies in real time based on the realized electricity supply and demand. Hence, optimizing industrial operations to benefit from periods with low electricity prices is vital to maximizing the benefits...

With the rising fuel costs, ride sharing is becoming a common mode of transportation. Sharing taxis which has been prominent in several developing countries is also becoming common in several cities around the world. Sharing taxis presents several advantages as it minimizes vacant seats in cars...

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)

We propose a simple exact algorithm for solving the generalized assignment problem. Our contribution is twofold: we reformulate the optimization problem into a sequence of decision problems, and we apply variable-fixing rules to solve these effectively. The decision problems are solved by a...

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...