A calculation method for material requirements which is based on BOP（Bill of Process） in assembly production is presented in this paper. Firstly, the BOP of assembly production is constructed. Then, the calculation ...A calculation method for material requirements which is based on BOP（Bill of Process） in assembly production is presented in this paper. Firstly, the BOP of assembly production is constructed. Then, the calculation method Based on the BOP is brought forward for material requirements planning.展开更多
Reconfigurable products and manufacturing systems have enabled manufacturers to provide ＂cost effective＂ variety to the market. In spite of these new technologies, the expense of manufacturing makes it infeasible to...Reconfigurable products and manufacturing systems have enabled manufacturers to provide ＂cost effective＂ variety to the market. In spite of these new technologies, the expense of manufacturing makes it infeasible to supply all the possible variants to the market for some industries. Therefore, the determination of the right number of product variantsto offer in the product portfolios becomes an important consideration. The product portfolio planning problem had been independently well studied from marketing and engineering perspectives. However, advantages can be gained from using a concurrent marketing and engineering approach. Concurrent product development strategies specifically for reconfigurable products and manufacturing systems can allow manufacturers to select best product portfolios from marketing, product design and manufacturing perspectives. A methodology for the concurrent design of a product portfolio and assembly system is presented. The objective of the concurrent product portfolio planning and assembly system design problem is to obtain the product variants that will make up the product portfolio such that oversupply of optional modules is minimized and the assembly line efficiency is maximized. Explicit design of the assembly system is obtained during the solution of the problem. It is assumed that the demand for optional modules and the assembly times for these modules are known a priori. A genetic algorithm is used in the solution of the problem. The basic premise of this methodology is that the selected product portfolio has a significant impact on the solution of the assembly line balancing problem. An example is used to validate this hypothesis. The example is then further developed to demonstrate how the methodology can be used to obtain the optimal product portfolio. This approach is intended for use by manufacturers during the early design stages of product family design.展开更多
An assembly type flowshop scheduling problem with minimizing makespan is considered in this paper. The problem of scheduling for minimizing makespan is first addressed, and then a new heuristic algorithm is proposed ...An assembly type flowshop scheduling problem with minimizing makespan is considered in this paper. The problem of scheduling for minimizing makespan is first addressed, and then a new heuristic algorithm is proposed for it.展开更多
This paper deals with the problem of planned lead time calculation in a Material Requirement Planning （MRP） environment under stochastic lead times. The objective is to minimize the sum of holding and backlogging co...This paper deals with the problem of planned lead time calculation in a Material Requirement Planning （MRP） environment under stochastic lead times. The objective is to minimize the sum of holding and backlogging costs. The proposed approach is based on discrete time inventory control where the decision variables are integer. Two types of systems are considered： multi-level serial-production and assembly systems. For the serial production systems （one type of component at each level）, a mathematical model is suggested. Then, it is proven that this model is equivalent to the well known discrete Newsboy Model. This directly provides the optimal values for the planned lead times. For multilevel assembly systems, a dedicated model is proposed and some properties of the decision variables and objective function are proven. These properties are used to calculate lower and upper limits on the decision variables and lower and upper bounds on the objective function. The obtained limits and bounds open the possibility to develop an efficient optimization algorithm using, for example, a Branch and Bound approach. The paper presents the proposed models in detail with corresponding proofs and se＇~eral numerical examples. Some advantages of the suggested models and perspectives of this research are discussed.展开更多
文摘A calculation method for material requirements which is based on BOP（Bill of Process） in assembly production is presented in this paper. Firstly, the BOP of assembly production is constructed. Then, the calculation method Based on the BOP is brought forward for material requirements planning.
文摘Reconfigurable products and manufacturing systems have enabled manufacturers to provide ＂cost effective＂ variety to the market. In spite of these new technologies, the expense of manufacturing makes it infeasible to supply all the possible variants to the market for some industries. Therefore, the determination of the right number of product variantsto offer in the product portfolios becomes an important consideration. The product portfolio planning problem had been independently well studied from marketing and engineering perspectives. However, advantages can be gained from using a concurrent marketing and engineering approach. Concurrent product development strategies specifically for reconfigurable products and manufacturing systems can allow manufacturers to select best product portfolios from marketing, product design and manufacturing perspectives. A methodology for the concurrent design of a product portfolio and assembly system is presented. The objective of the concurrent product portfolio planning and assembly system design problem is to obtain the product variants that will make up the product portfolio such that oversupply of optional modules is minimized and the assembly line efficiency is maximized. Explicit design of the assembly system is obtained during the solution of the problem. It is assumed that the demand for optional modules and the assembly times for these modules are known a priori. A genetic algorithm is used in the solution of the problem. The basic premise of this methodology is that the selected product portfolio has a significant impact on the solution of the assembly line balancing problem. An example is used to validate this hypothesis. The example is then further developed to demonstrate how the methodology can be used to obtain the optimal product portfolio. This approach is intended for use by manufacturers during the early design stages of product family design.
文摘An assembly type flowshop scheduling problem with minimizing makespan is considered in this paper. The problem of scheduling for minimizing makespan is first addressed, and then a new heuristic algorithm is proposed for it.
文摘This paper deals with the problem of planned lead time calculation in a Material Requirement Planning （MRP） environment under stochastic lead times. The objective is to minimize the sum of holding and backlogging costs. The proposed approach is based on discrete time inventory control where the decision variables are integer. Two types of systems are considered： multi-level serial-production and assembly systems. For the serial production systems （one type of component at each level）, a mathematical model is suggested. Then, it is proven that this model is equivalent to the well known discrete Newsboy Model. This directly provides the optimal values for the planned lead times. For multilevel assembly systems, a dedicated model is proposed and some properties of the decision variables and objective function are proven. These properties are used to calculate lower and upper limits on the decision variables and lower and upper bounds on the objective function. The obtained limits and bounds open the possibility to develop an efficient optimization algorithm using, for example, a Branch and Bound approach. The paper presents the proposed models in detail with corresponding proofs and se＇~eral numerical examples. Some advantages of the suggested models and perspectives of this research are discussed.
