scholarly journals Production Planning Problem of a Two-Level Supply Chain with Production-Time-Dependent Products

2021 ◽  
Vol 11 (20) ◽  
pp. 9687
Author(s):  
Jun-Hee Han ◽  
Ju-Yong Lee ◽  
Bongjoo Jeong
Keyword(s):  
Supply Chain ◽  
Production Planning ◽  
Programming Model ◽  
Planning Horizon ◽  
Mixed Integer ◽  
Planning Problem ◽  
Manufacturing Plant ◽  
Production Lines ◽  
Multiple Production ◽  
Production Planning Problem

This study considers a production planning problem with a two-level supply chain consisting of multiple suppliers and a manufacturing plant. Each supplier that consists of multiple production lines can produce several types of semi-finished products, and the manufacturing plant produces the finished products using the semi-finished products from the suppliers to meet dynamic demands. In the suppliers, different types of semi-finished products can be produced in the same batch, and products in the same batch can only be started simultaneously (at the same time) even if they complete at different times. The purpose of this study is to determine the selection of suppliers and their production lines for the production of semi-finished products for each period of a given planning horizon, and the objective is to minimize total costs associated with the supply chain during the whole planning horizon. To solve this problem, we suggest a mixed integer programming model and a heuristic algorithm. To verify performance of the algorithm, a series of tests are conducted on a number of instances, and the results are presented.

Optimization Methods for Lot-Sizing Problem in an Automated Foundry

2013 ◽  
Vol 58 (3) ◽  
pp. 863-866 ◽  
Author(s):  
J. Duda ◽  
A. Stawowy
Keyword(s):  
Production Planning ◽  
Lot Sizing ◽  
Planning Horizon ◽  
Optimization Methods ◽  
Mixed Integer ◽  
Planning Problem ◽  
Lot Size ◽  
Mip Model ◽  
Production Planning Problem ◽  
Problem Instances

Abstract In the paper we studied a production planning problem in a mid-size foundry that provides tailor-made cast products in small lots for a large number of clients. Assuming that a production bottleneck is the furnace, a mixed-integer programming (MIP) model is proposed to determine the lot size of the items and the required alloys to be produced during each period of the finite planning horizon that is subdivided into smaller periods. As using an advanced commercial MIP solvers may be impractical for more complex and large problem instances, we proposed and compared a few computational intelligence heuristics i.e. tabu search, genetic algorithm and differential evolution. The examination showed that heuristic approaches can provide a good compromise between speed and quality of solutions and can be used in real-world production planning.

scholarly journals Application of Two-Phase Fuzzy Optimization Approach to Multiproduct Multistage Integrated Production Planning with Linguistic Preference under Uncertainty

2015 ◽  
Vol 2015 ◽  
pp. 1-20 ◽  
Author(s):  
Shan Lu ◽  
Hongye Su ◽  
Lian Xiao ◽  
Li Zhu
Keyword(s):  
Production Planning ◽  
Programming Model ◽  
Fuzzy Optimization ◽  
Service Level ◽  
Mixed Integer ◽  
Planning Problem ◽  
Optimization Approach ◽  
Two Phase ◽  
Steel Rolling ◽  
Solution Approach

This paper tackles the challenges for a production planning problem with linguistic preference on the objectives in an uncertain multiproduct multistage manufacturing environment. The uncertain sources are modelled by fuzzy sets and involve those induced by both the epistemic factors of process and external factors from customers and suppliers. A fuzzy multiobjective mixed integer programming model with different objective priorities is proposed to address the problem which attempts to simultaneously minimize the relevant operations cost and maximize the average safety stock holding level and the average service level. The epistemic and external uncertainty is simultaneously considered and formulated as flexible constraints. By defining the priority levels, a two-phase fuzzy optimization approach is used to manage the preference extent and convert the original model into an auxiliary crisp one. Then a novel interactive solution approach is proposed to solve this problem. An industrial case originating from a steel rolling plant is applied to implement the proposed approach. The numerical results demonstrate the efficiency and feasibility to handle the linguistic preference and provide a compromised solution in an uncertain environment.

Application of Multi Objective Fuzzy Linear Programming in Supply Production Planning Problem

2012 ◽  
Author(s):  
Pandian M. Vasant
Keyword(s):  
Linear Programming ◽  
Production Planning ◽  
Membership Function ◽  
Programming Model ◽  
Real Life ◽  
Fuzzy Linear Programming ◽  
Programming Approach ◽  
Planning Problem ◽  
Production Planning Problem ◽  
S Curve

The objective of this paper is to establish the usefulness of modified s-curve membership function in a limited supply production planning problem with continuous variables. In this respect, fuzzy parameters of linear programming are modeled by non-linear membership functions such as s-curve function. This paper begins with an introduction and construction of the modified s-curve membership function. A numerical real life example of supply production planning problem is then presented. The computational results show the usefulness of the modified s-curve membership function with fuzzy linear programming technique in optimising individual objective functions, compared to non-fuzzy linear programming approach. Futhermore, the optimal solution helps to conclude that by incorporating fuzziness in a linear programming model through the objective function and constraints, a better level of satisfactory solution will be provided in respect to vagueness, compared to non-fuzzy linear programming.

scholarly journals The integrated cutting and packing heterogeneous precast beams multiperiod production planning problem  

2021 ◽  
Author(s):  
Kennedy Anderson Gumarães de Araújo ◽  
Tibérius de Oliveira e Bonates ◽  
Bruno Prata
Keyword(s):  
Genetic Algorithm ◽  
Production Planning ◽  
Programming Model ◽  
Optimal Solution ◽  
Planning Problem ◽  
Cutting And Packing ◽  
Novel Variant ◽  
Production Planning Problem ◽  
Genetic Algorithm Approach ◽  
Feasible Solutions

We introduce a novel variant of cutting production planning problems named Integrated Cutting and Packing Heterogeneous Precast Beams Multiperiod Production Planning (ICP-HPBMPP). We propose an integer linear programming model for the ICP-HPBMPP, as well as a lower bound for its optimal objective function value, which is empirically shown to be closer to the optimal solution value than the bound obtained from the linear relaxation of the model. We also propose a genetic algorithm approach for the ICP-HPBMPP as an alternative solution method. We discuss computational experiments and propose a parameterization for the genetic algorithm using D-optimal experimental design. We observe good performance of the exact approach when solving small-sized instances, although there are difficulties in finding optimal solutions for medium and large-sized problems, or even in finding feasible solutions for large instances. On the other hand, the genetic algorithm is shown to typically find good-quality solutions for large-sized instances within short computing times.

Sign in / Sign up

Export Citation Format

Share Document