Development of an Efficient Machine Loading Heudistic for Cellular Manufacturing System

سال انتشار: 1383
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 1,590

فایل این مقاله در 13 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

IIEC03_014

تاریخ نمایه سازی: 10 مهر 1385

چکیده مقاله:

Cellular manufacturing aims at identification of families of components (parts) and their associated machine groups in a job shop or a batch processing system. It is often observed that clear transformations of discrete manufacturing systems to cellular manufacturing systems are not feasible due to various practical constraints. Any discrete manufacturing system becomes dynamic as different sets of parts are loaded at different time periods. Further creating virtual cells will not automatically maximize the utilization of any system unless the set-up times are reduced by sequencing the parts most judiciously. A practical difficulty that has been experienced by the researchers in partand- machine-association is that a single set of tools in a dedicated machine-group cannot process all the parts of its associated part family. Tool changes are generally required. Thus in the cellular manufacturing systems tooling families are always formed and must be identified to exploit the available resources. The present work integrates a clustering algorithm and a group-scheduling algorithm (known as machine loading algorithm) to identify a product-mix strategy for any discrete manufacturing system where facility-timings are limited and all the parts may not get processed within the time limits. The clustering model first creates the (virtual) cells of machine groups. The machine loading algorithm thereafter utilizes an algorithm known as Minimax algorithm which determines the sequences, and the types of parts (of batches) that can be selected and optimally processed when allowable times are less, (more) or equal to the required timings of processing of all the loaded parts. If the available time is less the algorithm selects the parts that should be included and sequenced in a time frame. The machine loading algorithm utilizes another heuristic, SWAP in case a near optimal product-mix solution is resulted after using the Minimax algorithm. The validity of the model has been tested suitably to prove its usefulness. The model also includes realistic situations where machine groups could be changed by utilizing alternate process plans.

نویسندگان

Nirjhar Roy

M.N. National Institute of Technology, Allahabad, India

مراجع و منابع این مقاله:

لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :
  • Ballakur, A., and Studel, H. J.(1987) A within-cell utilization based ...
  • Burbidge, J.L. (1975). The introduction of group technology, William Heinemann ...
  • Chan, H. M. and Milner, D. A.(1982) «Direct Clustering Algorithm ...
  • Hitomi, K., and Ham, I. (1977). Group scheduling technique for ...
  • Hitomi, K., and Ham, I. (1982). Product mix and machine ...
  • King, J.R., and Nakornchai, V. , (1982) Machin e-component group ...
  • Lockwood, W. T., Mahmodi, F., Ruben, R. A., and Mosier, ...
  • Nagendra Parashar, B.S. and Somasundar H.V. (1998). A New measure ...
  • Roy, N., and Sengupta D. K. (1989) A machine loading ...
  • Roy, N., and Pachpor P. (2002), A genetic algorithm based ...
  • Waghodekar, P.H., & Sahu, S. (1984). Machi ne-component cell formation ...
  • Wemmerlov U, and Vakharia A. J. (1989), Job and family ...
  • Zolfaghari S., and Liang M.(1999), Jointly solving the group scheduling ...
  • نمایش کامل مراجع