NDSL 8,288 Link page¿¡¼­ [¿ø¹®º¸±â] ¹öÆ°À» Ŭ¸¯Çϼ¼¿ä.

[±¹³»³í¹®]

ÃÖ±Ù µé¾î ±â¾÷ÀÇ ¿ÜºÎ ȯ°æÀº ±Û·Î¹ú °æÀï, ¿ø°¡ Àý°¨°ú ÀÌÀ± È®º¸¿¡ ´ëÇÑ ¾Ð¹Ú ¹× ½Å±â¼úÀÇ ±Þ°ÝÇÑ ¹ßÀü µî¿¡ ÀÇÇØ ¸Å¿ì ±Þ¼ÓÇÏ°Ô º¯È­ÇÏ°í ÀÖ´Ù. ƯÈ÷, °í°´ ¿ä±¸ »çÇ×ÀÇ ºó¹øÇÑ º¯È­´Â Á¦Á¶ ±â¾÷¿¡°Ô ½É°¢ÇÑ µµÀüÀÌ µÇ°í ÀÖ´Ù. ÀÌ·¯ÇÑ µµÀü¿¡ ´ëÀÀÇϱâ À§Çؼ­´Â, °í°´ ¼­ºñ½º Çâ»ó°ú ¿î¿µ È¿À²¼º Á¦°í¸¦ À§ÇØ ¿©·¯ °ü¸® ±â´É Áß¿¡¼­ »ý»ê°èȹ ±â´ÉÀÌ ¿ì¼±ÀûÀ¸·Î Á¤¸³µÇ¾î¾ß ÇÑ´Ù. »ý»ê°èȹÀº Àüü °ø±Þ¸Á °ü¸® Áß¿¡¼­ »ý»ê ÇÁ·Î¼¼½º¿¡¼­ÀÇ ´Ü±âÀû ÀÇ»ç°áÁ¤À» ´Ù·ç¸ç, ±× ¿ªÇÒÀº °í°´ ÁÖ¹®°ú Á¦ÇÑµÈ ÀÚ¿ø »çÀÌ¿¡¼­ ±ÕÇüÀ» ã´Â °ÍÀÌ´Ù. º» ³í¹®ÀÇ ¸ñÀûÀº °ø±Þ¸Á °ü¸® °üÁ¡¿¡¼­ »ý»ê°èȹÀÇ ±â´É¼º°ú ½Ã½ºÅÛ ¾ÆÅ°ÅØó¸¦ ºÐ¼®ÇÏ°í, À̸¦ ±â¹ÝÀ¸·Î »ý»ê°èȹ ¼Ö·ç¼Çµé °£ÀÇ ºñ±³¸¦ °¡´ÉÄÉ Çϱâ À§ÇÑ ºÐ·ù ÇÁ·¹ÀÓ¿öÅ©¸¦ Á¦½ÃÇÏ´Â °ÍÀÌ´Ù.

[±¹³»³í¹®]

This paper explores a quantitative decision-making system for planning production, inventories and work-force in a multi-item production system. The Multi-item Parametric Decision Rule (MPDR) model, which assumes the existence of two types of linear feed-back rules, one for work-force level and one for production rates, is basically an extension of the existing method of Parametric Production Planning (PPP) proposed by C.H. Jones. The MPDR model, however, explicitly considers the effect of manufacturing progress and other factors such as employee turn-over, difference in work-days between month etc., and it also provides decision rules for production rates of individual items. First, the cost relations of the production system are estimated in terms of mathematical functions, and then decision rules for work-force level and production rates of individual items are establised based upon the estimated objective cost function. Finally, a direct search technique is used to find a set of parameters which minimizes the total cost of the objective function over a specified planning horizon, given estimates of future demands and initial values of inventories and work-force level. As a case problem, a hypothetical decision rule is developed for a particular firm (truck assembly factory).

[ÇØ¿Ü³í¹®]

The excessive volatility in supply chain planning increases its instability so to exacerbate the flow of goods in the chain. This paper explores ways of applying production planning to reduce the volatility of supply chain in terms of logistics. A 2-stage supply chain model is adopted in order to investigate the impact of production planning methodology on the supply chain volatility. Two production planning methods of S&OP and TOC approaches are chosen for simulation experiment. Comparative analysis of these two methods show that the TOC scheme does not induce a bigger supply chain volatility than the S&OP does, where the volatility index is measured by the ratio of variation sizes of production plan to sales plan. In conclusion, production planning function in supply chain is one of the most important factor along with the accuracy of sales plan in reducing the volatility of supply chain planning.

[±¹³»³í¹®]

µðÁöÅÐ ¼±¹Ú »ý»ê±â¼úÀº Á¶¼±¼Ò¿¡¼­ ÇÊ¿¬ÀûÀ¸·Î ¹ß»ýÇÏ´Â Àç°èȹ ¹× ÀçÀÛ¾÷¿¡ µû¸¥ ºñ¿ë°ú ½Ã°£À» Àý°¨ÇÒ ¼ö ÀÖ´Â ±â¼úÀÌ´Ù ÀÌ ±â¼úÀ» È¿À²ÀûÀ¸·Î Àû¿ëÇϱâ À§Çؼ­´Â Àû¿ë °¡´ÉÇÑ . ºÐ¾ß¿¡ ´ëÇÑ Àü·«¼ö¸³ÀÌ ¹Ýµå½Ã ÀÌ·ç¾îÁ®¾ß ÇÑ´Ù. º» ³í¹®¿¡¼­´Â Á¶¼±¼Ò »ý»ê°èȹ ¾÷¹« ÇÁ·Î¼¼½º¸¦ ºÐ¼®ÇÏ¿© µðÁöÅÐ ¼±¹Ú»ý»ê ±â¼úÀ» Àû¿ëÇϱâ À§ÇÑ Àü·«À» ¼ö¸³ÇÏ´Â °ÍÀ» ¸ñÇ¥·Î ÇÑ´Ù. BPR¹æ¹ý·ÐÀ» ±â¹ÝÀ¸·Î ÇöÇà »ý»ê°èȹ ¾÷¹«ÇÁ·Î¼¼½º¸¦ ºÐ¼®ÇÏ°í, ¿öÅ©Ç÷ο츦 ¸ðµ¨¸µÇÏ¿© º´¸ñÇÁ·Î¼¼½º¸¦ µµÃâÇÑ´Ù. µµÃâµÈ º´¸ñÇÁ·Î¼¼½º¸¦ ½ÉµµÀÖ°Ô ºÐ¼®ÇÏ¿© Çٽɰ³¼±±âȸ ´ÙÀ̾î±×·¥À» ÀÛ¼ºÇÏ°í, ÇÁ·Î¼¼½º½Ã¹Ä·¹À̼ÇÀ» ¼öÇàÇÏ¿© Àû¿ë½Ã³ª¸®¿À »ý¼º»Ó¸¸ ¾Æ´Ï¶ó ±â´ëÈ¿°úµµ »êÃâÇÑ´Ù. µðÁöÅÐ ¼±¹Ú»ý»ê±â¼úÀÇ Àû¿ëÀü·«Àº Á¶¼±¼Ò¿¡¼­ ¾çÁúÀÇ Á¦Ç°¿¡ ÇÊ¿äÇÑ °ÇÁ¶ ºñ¿ë ¹× ½Ã°£À» ÁÙÀÏ ¼ö ÀÖ´Â ¹Ø±×¸²À» Á¦°øÇÒ °ÍÀ¸·Î »ç·áµÈ´Ù.

[±¹³»³í¹®]

[±¹³»³í¹®]

An approach to Just-In-Time for small job-shop-type manufacturers is presented. This is aimed at those who understand the pull production system, however, cannot afford either swift changeover in workcenters or frequent delivery to customers. First, as a production planning technique, a lot-sizing model entitled Multilevel Least Total Cost Model(MLTCM) is developed; The production order quantities of each components be those requiremensts of the end item production lot. The contribution of MLTCM is shown via simulation. Then, a framework of the Kanban operations is designed; A Production Control Kanban is introduced as a communication tool with Production Kanban in a job-shop.

[ÇØ¿Ü³í¹®]

This research is concerned with production scheduling for FMS (Flexible Manufacturing System) which consists of machine centers served by cycle conveyor. The objective of the research is to develop and evaluate scheduling procedures to minimize the mean flow time. An optimal algorithm called SCTF (Shortest Circle Time First) is proposed when the conveyor runs at minimum possible speed (CS=1) and a heuristic algorithm called SCTJMF (Shortest Cycle Time and Job Matching Algorithm) is suggested when the conveyor runs at double speed (CS=2). The evaluation of the heuristic algorithm was implemented by comparison with the optimal algorithm for 112 experimentations for CS=1 and random schedule. The results showed that the proposed heuristic algorithm provides better solution that can be regarded noticeable when compared with SCTF algorithm and random scheduling.

[±¹³»³í¹®]

[±¹³»³í¹®]

& & ¿À´Ã³¯ ±â¾÷µéÀº °æÀï·Â °­È­¸¦ À§ÇÏ¿© ERP ¹× SCM µîÀ» µµÀÔÇÏ°í È°¿ëÇϱâ À§ÇÏ¿© ¸¹Àº ³ë·ÂÀ» ±â¿ïÀÌ°í ÀÖ´Ù. ERP´Â ÇÁ·Î¼¼½º Áß½ÉÀÇ ÅëÇÕ¼ºÀ» ÀÌ·ç´Â µ¥´Â ¸Å¿ì È¿°úÀûÀÌÁö¸¸, ÃÖÀû »ý»ê°èȹÀ» ¼ö¸³ÇÏ´Â °Í¿¡´Â ÇѰ踦 º¸ÀδÙ. ÀÌ·¯ÇÑ ÇѰ踦 ±Øº¹Çϱâ À§ÇÏ¿© SCM ÃÖÀûÈ­ ¼ÒÇÁÆ®¿þ¾î¸¦ ERP ½Ã½ºÅÛ¿¡ Á¢¸ñÇÏ¿© È°¿ëÇÏ´Â »ç·Ê°¡ ´Ã°í ÀÖ´Ù. ±×·¯³ª SCM ÃÖÀûÈ­ ¼ÒÇÁÆ®¿þ¾î°¡ Á¦´ë·Î È°¿ëµÇ±â À§Çؼ­´Â »ý»ê°èȹÇÁ·Î¼¼½º°¡ ¿ì¼± ÃÖÀûÈ­µÇ¾î ½Ã½ºÅÛÀÌ È¿°ú¸¦ ¹ßÈÖÇÒ ¼ö Àִ ȯ°æÀÌ ¸¶·ÃµÇ¾î¾ß ÇÑ´Ù.& & ÀÌ ¿¬±¸´Â H»çÀÇ »ý»ê°èȹ ÇÁ·Î¼¼½º¸¦ ÃÖÀûÈ­½ÃŲ ÇÁ·ÎÁ§Æ® »ç·Ê¸¦ ÅëÇÏ¿© ±â¾÷µéÀÌ ±âÁ¸ÀÇ ERP ¿Í SCM½Ã½ºÅÛÀ» ¿î¿µÇϸ鼭 ½Ã½ºÅÛ ±¸Çö»Ó¸¸ ¾Æ´Ï¶ó ÇÁ·Î¼¼½º Á¤¸³À» ÅëÇؼ­ ½Ã½ºÅÛÀÇ ¼º°ú¸¦ Çâ»ó½Ãų ¼ö ÀÖ´Ù´Â Á¡À» ÆľÇÇÏ°í ÀÚµ¿È­µÈ ÃÖÀû °èȹ ¼ö¸³À» È°¿ëÇϱâ À§ÇÏ¿© ¾î¶°ÇÑ °³¼±ÀÌ ÇÊ¿äÇÑ Áö¸¦ »ìÆ캸¾Ò´Ù. Áï, ½Ã½ºÅÛÀÌ Á¦´ë·Î ¿î¿µµÇÁö ¾Ê´Â ±Ùº» ¿øÀεéÀ» ÆľÇÇÏ°í À̸¦ °³¼±ÇÑ °úÁ¦¿¡ ´ëÇØ ¿¬±¸ÇÏ¿´´Ù.

[±¹³»³í¹®]

This research is concerned with production scheduling for FMS (Flexible Manufacturing System) which consists of machine centers served by cycle conveyor. The objective of the research is to develop and evaluate scheduling procedures to minimize the mean flow time. An optimal algorithm called SCTF (Shortest Circle Time First) is proposed when the conveyor runs at minimum possible speed (CS=1) and a heuristic algorithm called SCTJMF (Shortest Cycle Time and Job Matching Algorithm) is suggested when the conveyor runs at double speed (CS=2). The evaluation of the heuristic algorithm was implemented by comparison with the optimal algorithm for 112 experimentations for CS=1 and random schedule. The results showed that the proposed heuristic algorithm provides better solution that can be regarded noticeable when compared with SCTF algorithm and random scheduling.

[±¹³»³í¹®]

Group scheduling problem in a multi-stage manufacturing system is reviewed and two heuristic procedures for minimizing the makespan are developed by employing the methods of flow shop sequencing heuristics with a slight modification. The comparisons among the five heuristics, three previously reported heuristics and two heuristics suggested by this study, are made on different problem sizes. The computational results indicate that NEH-GS method gives better group schedules than the other heuristics tested, but its computation time increases rapidly as the problem size increases. On the other hand, CDS-GS method provides relatively good group schedules with less computation time compared with NEH-GS method.

[±¹³»³í¹®]

Dynamic production planning problems are to determine the optimal production times and production quantities of product for discrete finite periods. In previous many researches, the solutions for these problems have been developed through the algorithms using dynamic programming. The purpose of this research is to suggest the new algorithm using linear programming. This research is to determine optimal production quantities of product in each period to satisfy dynamic for discrete finite periods, minimizing the total of production cost and inventory holding cost. Cost functions are concave, and no backlogging for product is allowed. The new algorithm for capacity constrained problem is developed.

[ÇØ¿Ü³í¹®]

This paper explores a quantitative decision-making system for planning production, inventories and work-force in a multi-item production system. The Multi-item Parametric Decision Rule (MPDR) model, which assumes the existence of two types of linear feed-back rules, one for work-force level and one for production rates, is basically an extension of the existing method of Parametric Production Planning (PPP) proposed by C.H. Jones. The MPDR model, however, explicitly considers the effect of manufacturing progress and other factors such as employee turn-over, difference in work-days between month etc., and it also provides decision rules for production rates of individual items. First, the cost relations of the production system are estimated in terms of mathematical functions, and then decision rules for work-force level and production rates of individual items are establised based upon the estimated objective cost function. Finally, a direct search technique is used to find a set of parameters which minimizes the total cost of the objective function over a specified planning horizon, given estimates of future demands and initial values of inventories and work-force level. As a case problem, a hypothetical decision rule is developed for a particular firm (truck assembly factory).

[ÇØ¿Ü³í¹®]

Group scheduling problem in a multi-stage manufacturing system is reviewed and two heuristic procedures for minimizing the makespan are developed by employing the methods of flow shop sequencing heuristics with a slight modification. The comparisons among the five heuristics, three previously reported heuristics and two heuristics suggested by this study, are made on different problem sizes. The computational results indicate that NEH-GS method gives better group schedules than the other heuristics tested, but its computation time increases rapidly as the problem size increases. On the other hand, CDS-GS method provides relatively good group schedules with less computation time compared with NEH-GS method.

[±¹³»³í¹®]

The problem of planning national coal production is formulated as an optimal control problem. The model can be used to propose a proper government subsidy policy which will enhance the utilization of a nationally-owned resurce(coal) and maintain the optimal level of coal production.

[±¹³» ȸÀÇÀÚ·á]

In this paper, scheduling problem is dealt for the minimization of due date penalty for the customer order. Multiproduct batch processes have been dealt with for their suitability for high value added low volume products. Their scheduling problems take minimization of process operation for objective function, which is not enough to meet the customer satisfaction and the process efficiency simultaneously because of increasing requirement of fast adaptation for rapid changing market condition. So new target function has been suggested by other researches to meet two goals. Penalty function minimization is one of them. To present more precisely production scheduling, we develop new scheduling model with penalty function of earliness and tardiness We can find many real cases that penalty parameters are divergent by the difference between the completion time of operation and due date. That is to say, the penalty parameter values for the product change by the customer demand condition. If the order charges different value for due date, we can solve it with the due date period. The period means the time scope where penalty parameter value is 0. If we make use of the due date period, the optimal sequence of our model is not always same with that of fixed due date point. And if every product have due date period, due date of them are overlapped which needs optimization for the maximum profit and minimum penalty. Due date period extension can be enlarged to makespan minimization if every product has the same abundant due date period and same penalty parameter. We solve this new scheduling model by simulated annealing method. We also develop the program, which can calculate the optimal sequence and display the Gantt chart showing the unit progress and time allocation only with processing data.

[±¹³»³í¹®]

Many enterprises are performing the production planning computerization for survival in unlimited competing period. But it is very difficult to directly apply many production planning softwares to the domain-specific areas of many small enterprises because one enterprise is different from the others with respect to product type, production process, and order fulfillment method. Practically most small enterprises depend on experienced production managers in production planning, so then many problems such as overtime work and cost have been appeared. The purpose of this study is to develop production planning module for order-made production system in order to reduce overtime works and surplus costs. We developed production planning module with RDBMS, which is fit for small manufacturing company. Developing this software, we use Visual Basic 5.0 to provide GUI environment for the production planning module and Microsoft Access 97 is used to construct Database. This production planning module is applied to enhancement of productivity in M manufacturing company located in Asan.

/ 277

Filters

º¸±âÇü½Ä

Á¤·Ä¼ø¼­

Æ÷¸Ë

¸®½ºÆ® ¼ö