CIVILICA We Respect the Science
(ناشر تخصصی کنفرانسهای کشور / شماره مجوز انتشارات از وزارت فرهنگ و ارشاد اسلامی: ۸۹۷۱)

A heuristic algorithm for single-item lot-sizing problem

عنوان مقاله: A heuristic algorithm for single-item lot-sizing problem
شناسه (COI) مقاله: ICMI01_171
منتشر شده در کنفرانس بین المللی مدیریت و مهندسی صنایع در سال 1393
مشخصات نویسندگان مقاله:

Esmail Mahdizadeh - Assistant Professor, Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
Amir Fatehi Kivi - Ph.D. Candidate, Department of industrial Engineering, Science and Research branch, Islamic Azad University, Tehran, Iran
Amir Aydin Atashi Abkenar - M.Sc. Student of Industrial Engineering, Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran

خلاصه مقاله:
Production planning is one of the most important and challenging issues of production. Although, this has been widely investigated in the production planning literature, yet current algorithms take a great deal of time to solve these problems. In this paper, a heuristic method is introduced to measure lot-size assuming no production capacity limitation and no shortage. Finally, the results will be compared with Wagner and Whitin algorithm from the quality of solution and length of time to obtain the solution viewpoints. The results of numerical examples reflect a significant decrease in the duration of calculations.

کلمات کلیدی:
production planning, order quantity, optimization, Wagner and Whitin algorithm

صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/415566/