《HEURISTIC MODELING FOR A DYNAMIC AND GOAL PROGRAMMING IN PRODUCTION PLANNING OF CONTINUOUS MANUFACTURING SYSTEMS .doc》由会员分享，可在线阅读，更多相关《HEURISTIC MODELING FOR A DYNAMIC AND GOAL PROGRAMMING IN PRODUCTION PLANNING OF CONTINUOUS MANUFACTURING SYSTEMS .doc（5页珍藏版）》请在三一办公上搜索。
1、110CHINESE JOURNAL OF MECHANICAL ENGINEERING Vol. 20, No. 5, 2007SJAHANA ABDOLSHAH MDepartment of Industrial Engineering,Islamic Azad University-Semnan branch,Semnan, IranHEURISTIC MODELING FOR A DYNAMIC AND GOAL PROGRAMMING IN PRODUCTION PLANNING OF CONTINUOUS MANUFACTURING SYSTEMSAbstract: At the
2、first sight it seems that advanced operation research is not used enough in continuous production systems as comparison with mass production, batch production and job shop systems, but really in a comprehensive evaluation the advanced operation research techniques can be used in continuous productio
3、n systems in developing countries very widely, because of initial inadequate plant layout, stage by stage development of production lines, the purchase of second hand machineries from various countries, plurality of customers. A case of production system planning is proposed for a chemical company i
4、n which the above mentioned conditions are almost presented. The goals and constraints in this issue are as follows: Minimizing deviation of customers requirements. Maximizing the profit. Minimizing the frequencies of changes in formula production. Minimizing the inventory of final products. Balanci
5、ng the production sections with regard to rate in production. Limitation in inventory of re- i?bifiial. The present situation is in such a way that various techniques such as goal proij-ji.n int, linear programming and dynamic programming can be used. But dynanir production pog-amtiing is&ks are div
6、ided into two categories, at first one with lira cation in production capacity ;.j another with unlimited production capacity. For tK first category, a systematic vA acceptable solution has not been presented yet. Therefore Mi innovative method ;s used to convert the dynamic situation to a zero- one
7、 model. At last fhi;i isscit i.i ch.-nged to a goal programming model with non-linear limitations with the use of GRG i),)rithm rind iiats how it is solved. Key words: Heuristic model Dynamic programming Goal programming production planning0 INTRODUCTIONProduction planning is a complicated process w
8、hich needs to gather too much information from different sections of an organization to perform it properly. It is also necessary to recognize the operational conditions over the problem perfectly. Meanwhile, some items such as the kind of production system (continuous, mass production, batch, or jo
9、b-shop productions), various production methods, capacities of production lines, time and costs spent to run different production processes, the available sources, profits and the amount of demand for different products, and finally the method of selling the products regarding retail, wholesale or p
10、roduction on the basis of order, are all considered as operational items which affect the kind and scale of complicacy over production planning systems.Nowadays, various operation research techniques are widely used in designing production planning systems and this subject is related directly to the
11、 kind of production system. At the first sight, it may seem that advanced techniques of operation research are not used enough in production planning of continuous lines in comparison with mass, batch, or job-shop production systems. But really the advanced techniques can be widely used in continuou
12、s production systems in developing countries, because such countries are encountered with initial inadequate lay out, stage by stage development of production lines, the purchase of second hand machineries from different countries, numerous customers, sharp oscillations on market demand.A case is pr
13、esented to study how to design a production planning system for a chemical company in which the above mentioned conditions are presented, and its modeling requires dynamic and goal programming.Received September 7, 2006; accepted November 10, 20061 PREFACE TO GOAL PROGRAMMINGIn making decisions, som
14、etimes we confront goal that their preferences are not equal to fulfill, so to create a model in form of linear programming is not possible and it is necessary to apply a method called goal programming.In goal programming, a suitable level is defined for all of the purposes, and a specific priority
15、is considered for each goal to reach, goal programming doesnt regard these suitable levels absolutely, but just hopes to attain them all. Therefore, according to the devoted priorities, it attempts to solve how to reach to an improvement, so as to get closer to the suitable levels as much as possibl
16、e. A general model of a goal programming is as follows(1) (2)(3) (4)JVImin Z = Z,PKiZKdl+KAs.t. Zai/X, + di - d* = bl = 2 3*y=ic.jr,. =/,. i = l,2,3,-,mj-iEq. (1) is the function of purpose in goal programming problems that minimize the total weight of deviations from the goal function. So W and W a
17、re the weight coefficients to indicate the positive or negative deviation of the suitable levels and PK determines the priorities of the goal.In Eq. (l),/ is bigger than/+l, and the goal AT +1 will not be propounded in the problem until the K goal reaches the suitable level.Eq. (2) is the goal limit
18、ation which in goal function we wish 1994-2007 China Academic Journal Electronic Publishing House. All rights reserved, CHINESE JOURNAL OF MECHANICAL ENGINEERING 111 to minimize its deviation from the suitable level by devoting desirable weight b for its deviation. In Eq. (3) we observe a real limit
19、ation in which there is no mistake, and at last Eq. (4) expresses that non of the variables are negative.2PREFACE TO DYNAMIC PROGRAMMINGDynamic programming is a method often used for a series of continuous and dependant decisions to make. Dynamic programming is called dynamic, because its all proble
20、ms must be solved step by step to get response, and the acceptable solutions must just be considered in each stage. Dynamic programming system has a generality in operation research discussions that is applied in solving programs such as linear and non-linear programming and non-linear programming w
21、ith correct variables. But its not economical to apply it when dimensions of the problem are so big, because to solve such a program will be consuming a lot of time and also needs much attention. Model making and solving the problems in production planning are the uses of this method which in variou
22、s periods, has a variety in costs, different sources and also changes in requests.The issues stated in dynamic production programming are entirely divided into two groups. Issues which have limitation in production capacity and without any limitation in production capacity, an efficient and acceptab
23、le solution has not been presented yet for the second state.3EXPRESSING THE CONDITIONS OF ANISSUEThis paper is a case study for creating a production programming system at z company that produces different detergents. This company:- f/il products are made in the form of three various formulas, ano t
24、hen the products are packed and delivered to customer in different forms and sizes. It is a continuous production system and is formed of three sections: preparing raw material (paste production), producing detergent power and packaging.Before this research done, the company was encountered with so
25、many troubles that we can mention some of the most important ones as follows. The customers dissatisfaction not delivering in time, the frequencies of changes in production formula, high amount and volume of storing the final products produced. Therefore, after the investigation and research done ab
26、out the condition over this issue, limitation and goal were considered as follows.3.1Minimizing deviation of customers requirementsDelivering the products in time resulting the customers satisfaction has the most important priority for such an organization, so a decision was made for the sales depar
27、tment to transfer the customers requirement to the programming department, according to plurality of customers and varieties of their requests and needs, it was also decided for sales department to inform programming department about the importance degree of supplying the needed products.3.2Maximizi
28、ng the profitThe goal of such an organization is to account the profit of each product and to maximize it on the basis of production planning.3.3Minimizing the frequencies of changes in formulaproductionBefore creating a production planning system, the production department had to change the formula
29、 frequently for the sake of not paying any attention to balanced production lines and limitation not to have raw material.The company had to pay much for these changes and minimizing these costs is one of the goals in production planning system. Changing the formula includes the waste of useful time
30、 for production and destroyed materials which differ, according tothe kind of changes in formula.3.4Minimizing the inventory of final productsSometimes, selling the products may not be performed at the specific time and doesnt match the primary schedule of sales department. And this is why the compa
31、ny has to use space outside the store (open space) to keep the products concerning the limited capacity of final storage.This may also increase the products, destruction and more further make problems to the lack of space for transportation, therefore considering the possession of required space to
32、store each kind of product, and to present a suitable production planning in order to minimize space used outside the store (open space) will be another goal of this planning.3.5Balancing the production sections with regard torate in productionBalancing the production rate among the three sections:
33、Inventory of raw material (paste production), detergent power production, and packaging are also the goals of this production planning system.3.6Limitation in inventory of raw materialEach kind of the production needs a specific kind and rate of raw material, so according to the commons shared among
34、 some of the raw material, its necessary 0(6)i = 1,2,3,-.h j = 1,2,3,- -.mwhere WitWeight (importance degree), customers requirement of detergent power in formula / packaging jnThe number of different kinds of formulas indetergent power productionmThe number of different kinds in packaging detergent
35、 power for each formulaTKjjThe number of cartons needed for producing onekilogram of detergent powder in formula / packaging j 19 4-2 07 hin A a mic urnalElectr i P i hi gHh re. etJAHAN A, et al: Heuristic modeling for a dynamic and goal programming in production 112 planning of continuous manufactu
36、ring systemsXyThe amount of detergent power production (kg)5.2in formula / packaging;dDu-The amount of decrease in production regarding the customers need in formula; packaging;D-The number of customers requirements form formula ; packaging/Maximizing profit and minimizing the costs of changes for p
37、roduction formula (second priority)min (-dB)n ms.t. XZ Vff - CflYfi - CflYfi. -/-i y-iSEmpty space at storedS*Used space outside the store in cubic meter as astore5.4 Limitations + 11YrXj,=0Y,Yfi.=0It*!*! 0 / = l,2,3,-, ; = 1,2,3,-,/*where dBPure profitbyThe rate of profit for each /ri!o/jran; of de
38、tergentpower using torr/iulit / packaging jfThe present formula used in productionCyCharge of change in production from i into;YyTo change the production formulation or notchannging it from ; into ; (zero-one variable) Regarding Eq. (7) maximizes function of goal profit and minimizes the charge to c
39、hange formulation, it is comprehensive in Eq. (8) considering Fig. 1, we can just move from the present formula towards two other formulas, and Eqs. (9),(10) indicate change in direction of formulation. Eqs. (11),(12) determine if change in formulation is not beneficial, products wont be produced en
40、tirely.(17)UPAyXPA(18)ZZTPyXTPi-l l-(19)ZYJBtXt/:*/P2(-dB),P3(dS*)Fig. 1 Indication of present formula change direction into formulas i and V5.3 Minimizing use of space outside the store as a store (last priority)minfdS*)s.t. ZZSJKX,-dS*=S(14)which is subject to Eqs.(l)-(19). 6 MODEL RESULTSTables 1-4 indicate the sample input data in the model and Table S indicates the results gotten through solving the problem to apply algorithm GRG with LINGO software.Table 1 Sample input datacustomers deman
