P R E S E N T I N G A H E U R I S T I C A L G O R I T H M F O R I N T E G R A T E D P R O D U C T M I X-O U T S O U R C I N G P R O B L E M U N D E R T H E O R Y O F C O N S T R A I N T
Author(s):
Abstract:
Determining the production rate of each product in order to maximize the throughput is important for production systems. This problem is called the product mix (PM) problem. In most cases, due to insufficient production resources, companies tend to obtain some of their products from external resources. Given this, PM, with the decision to outsource production, a combined and integrated product mix-outsourcing problem (IPMO) is formed. Here, the main question is how much of each product should be produced internally and how much should be outsourced. One of the most famous methods for solving the IPMO problem is the theory of constraints (TOC). TOC offers a five step methodology for the identification of organizational constraints and their elevation. The methodology is described as follows: (1) Identify the system's constraint(s) (2) Decide how to exploit the system's constraint(s) (3) Subordinate everything else to the above decision (4) Elevate the system's constraint(s)(5) If, in the previous steps, a constraint has been broken, go back to step1.In step1, the system bottleneck is dentified. In step 2, the scheduler decides how to use the bottleneck in order to maximize the throughput. In step 3, the bottleneck schedule (drum) is developed and, through backward and forward scheduling, other work centers are scheduled. In step 4, necessary improvements are considered in order to promote the bottleneck performance. And, finally, step 5 indicates the dynamic nature of the TOC. The product mix is determined through the first two steps of the TOC. In this study, we will introduce a simple and heuristic method based on TOC to solve IPMO problems in multi-bottleneck mode. First, it is shown, by an example, that available heuristic algorithms for solving the IPMO problem do not necessarily lead to optimum and even feasible solutions. Then, the proposed algorithm is compared with existing methods in the literature in single and multi-bottleneck modes, and it is indicated that the proposed algorithm is able to achieve appropriate solutions
Keywords:
Language:
Persian
Published:
Industrial Engineering & Management Sharif, Volume:30 Issue: 1, 2014
Pages:
101 to 107
magiran.com/p1359078
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 1,390,000ريال میتوانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
- حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران میشود.
- پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانههای چاپی و دیجیتال را به کاربر نمیدهد.
In order to view content subscription is required
Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!