scholarly journals Fashion Supply Chain Optimization: A Linear Programming Model

2022 ◽  
Author(s):  
Sara Shoarinejad ◽  
Amin Shoari Nejad
Keyword(s):  
Supply Chain ◽  
Demand Uncertainty ◽  
Programming Model ◽  
Complex Structure ◽  
Global Competition ◽  
Supply Chain Optimization ◽  
Fashion Brand ◽  
Emerging Trends ◽  
Short Product ◽  
Algebraic Modelling

Fashion supply chain management is challenging due to demand uncertainty, short product life, fierce global competition, and increasing expectations such as product diversity and keeping pace with the current and emerging trends. In this paper, a brief review of the published works in the field of fashion and clothing supply chain is given and an integrated linear model is presented to minimize a fashion brand’s costs, including production and logistics costs, enabling the firm to make better decisions with regard to its production and replenishment policies and responding in a reasonable time to customers demands for various designed items. We show that our model can successfully account for complex structure of the supply chain consisting of designer, manufacturers, distributors, and stores. The model is validated using the General Algebraic Modelling System (GAMS) with the data collected from an Iranian fashion brand.

scholarly journals Local Blood Supply Chain Optimization: A Case Study

2020 ◽  
Vol 18 (4) ◽  
Author(s):  
Reza Babazadeh ◽  
Ali Sabbaghnia ◽  
Fatemeh Shafipour
Keyword(s):  
Supply Chain ◽  
Blood Supply ◽  
Blood Donation ◽  
Programming Model ◽  
Human Life ◽  
Mixed Integer ◽  
Model Parameters ◽  
Supply Chain Optimization ◽  
Blood Supply Chain ◽  
Proposed Model

: Blood and its products play an undeniable role in human life. In recent years, although both academics and practitioners have investigated blood-related problems, further enhancement is still warranted. In this study, a mixed-integer linear programming model was proposed for local blood supply chain management. A supply network, including temporary and fixed blood donation facilities, blood banks, and blood processing centers, was designed regarding the deteriorating nature of blood. The proposed model was applied in a real case in Urmia, Iran. The numerical results and sensitivity analysis of the key model parameters ensured the applicability of the proposed model.

scholarly journals Supply chain optimization with variable demand by considering financial criteria and scenarios

2017 ◽  
Vol 26 (44) ◽  
pp. 21 ◽  
Author(s):  
John Willmer Escobar
Keyword(s):  
Supply Chain ◽  
Large Scale ◽  
Net Present Value ◽  
Programming Model ◽  
Supply Chain Design ◽  
Mixed Integer ◽  
Supply Network ◽  
Distribution Centers ◽  
Supply Chain Optimization ◽  
Starting Point

This paper contemplates the supply chain design problem of a large-scale company by considering the maximization of the Net Present Value. In particular, the variability of the demand for each type of product at each customer zone has been estimated. As starting point, this paper considers an established supply chain for which the main problem is to determine the decisions regarding expansion of distribution centers. The problem is solved by using a mixed-integer linear programming model, which optimizes the different demand scenarios. The proposed methodology uses a scheme of optimization based on the generation of multiple demand scenarios of the supply network. The model is based on a real case taken from a multinational food company, which supplies to the Colombian and some international markets. The obtained results were compared with the equivalent present costs minimization scheme of the supply network, and showed the importance and efficiency of the proposed approach as an alternative for the supply chain design with stochastic parameters.

Modular Supply chain optimization considering demand uncertainty to manage risk

AIChE Journal ◽  
2021 ◽  
Author(s):  
Atharv Bhosekar ◽  
Oluwadare Badejo ◽  
Marianthi Ierapetritou
Keyword(s):  
Supply Chain ◽  
Demand Uncertainty ◽  
Supply Chain Optimization

scholarly journals A Hybrid Method for Modeling and Solving Supply Chain Optimization Problems with Soft and Logical Constraints

2016 ◽  
Vol 2016 ◽  
pp. 1-16 ◽  
Author(s):  
Paweł Sitek ◽  
Krzysztof Bzdyra ◽  
Jarosław Wikarek
Keyword(s):  
Supply Chain ◽  
Hybrid Method ◽  
Optimization Problems ◽  
Programming Model ◽  
Combinatorial Problem ◽  
Search Space ◽  
Mixed Integer ◽  
Optimization Models ◽  
Supply Chain Optimization ◽  
Logical Constraints

This paper presents a hybrid method for modeling and solving supply chain optimization problems with soft, hard, and logical constraints. Ability to implement soft and logical constraints is a very important functionality for supply chain optimization models. Such constraints are particularly useful for modeling problems resulting from commercial agreements, contracts, competition, technology, safety, and environmental conditions. Two programming and solving environments, mathematical programming (MP) and constraint logic programming (CLP), were combined in the hybrid method. This integration, hybridization, and the adequate multidimensional transformation of the problem (as a presolving method) helped to substantially reduce the search space of combinatorial models for supply chain optimization problems. The operation research MP and declarative CLP, where constraints are modeled in different ways and different solving procedures are implemented, were linked together to use the strengths of both. This approach is particularly important for the decision and combinatorial optimization models with the objective function and constraints, there are many decision variables, and these are summed (common in manufacturing, supply chain management, project management, and logistic problems). TheECLiPSesystem with Eplex library was proposed to implement a hybrid method. Additionally, the proposed hybrid transformed model is compared with the MILP-Mixed Integer Linear Programming model on the same data instances. For illustrative models, its use allowed finding optimal solutions eight to one hundred times faster and reducing the size of the combinatorial problem to a significant extent.

Sign in / Sign up

Export Citation Format

Share Document