Optimal Crashing of Multi Period-Multi Product Production Planning Problems
نویسندگان
چکیده
To save overhead and penalty costs, in many cases of Multi-Period Multi-Product (MPMP) planning systems, reducing the completion time is highly desirable. Therefore, in this paper we study this problem. We propose an approach in which a MPMP problem is converted into a project management network. Then, considering network concepts and properties, a multi stage novel mathematical model is proposed. Therefore, it is possible to crash each operation in accordance with the relevant cost components in order to decrease total cost by controlling the production planning completion time. Finally, an algorithm is developed. Thus, the proposed approach integrates both project management network and mathematical programming techniques in a production planning problem. Key word: Multi-period Multi-Production (MPMP) • crashing • network • optimization
منابع مشابه
Building a Multi-Objective Model for Multi-Product Multi-Period Production Planning with Controllable Processing Times: A Real Case Problem
Model building is a fragile and complex process especially in the context of real cases. Each real case problem has its own characteristics with new concepts and conditions. A correct model should have some essential characteristics such as: being compatible with real conditions, being of sufficient accuracy, being logically traceable and etc. This paper discusses how to build an efficient mode...
متن کاملDynamic Multi Period Production Planning Problem with Semi Markovian Variable Cost (TECHNICAL NOTE)
This paper develops a method for solving the single product multi-period production-planning problem, in which the production and the inventory costs of each period arc concave and backlogging is not permitted. It is also assumed that the unit variable cost of the production evolves according to a continuous time Markov process. We prove that this production-planning problem can be Stated as a ...
متن کاملCombination of Genetic Algorithm With Lagrange Multipliers For Lot-Size Determination in Capacity Constrained Multi-Period, Multi-Product and Multi-Stage Problems
Abstract : In this paper a meta-heuristic approach has been presented to solve lot-size determination problems in a complex multi-stage production planning problems with production capacity constraint. This type of problems has multiple products with sequential production processes which are manufactured in different periods to meet customer’s demand. By determining the decision variables, mac...
متن کاملMeta-heuristic Algorithms for an Integrated Production-Distribution Planning Problem in a Multi-Objective Supply Chain
In today's globalization, an effective integration of production and distribution plans into a unified framework is crucial for attaining competitive advantage. This paper addresses an integrated multi-product and multi-time period production/distribution planning problem for a two-echelon supply chain subject to the real-world variables and constraints. It is assumed that all transportations a...
متن کاملA mixed integer linear programming formulation for a multi-stage, multi-Product, multi-vehicle aggregate production-distribution planning problem
In today’s competitive market place, companies seek an efficient structure of supply chain so as to provide customers with highest value and achieve competitive advantage. This requires a broader perspective than just the borders of an individual company during a supply chain. This paper investigates an aggregate production planning problem integrated with distribution issues in a supply chain ...
متن کامل