جلد 20، شماره 1 و 1-2 - ( 2-1388 )                   جلد 20 شماره 1 و 1-2 صفحات 1-10 | برگشت به فهرست نسخه ها


XML English Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

The Economic Lot Scheduling Problem in Flow Lines with Sequence-Dependent Setups. IJIEPR. 2009; 20 (1 and 1-2) :1-10
URL: http://ijiepr.iust.ac.ir/article-1-44-fa.html
Heydar M.، Karimi B.، Torabi S.A. The Economic Lot Scheduling Problem in Flow Lines with Sequence-Dependent Setups. نشریه بین المللی مهندسی صنایع و تحقیقات تولید. 1388; 20 (1 و 1-2) :1-10

URL: http://ijiepr.iust.ac.ir/article-1-44-fa.html


، b.karimi@aut.ac.ir
چکیده:   (9903 مشاهده)

  The problem of lot sizing, sequencing and scheduling multiple products in flow line production systems has been studied by several authors. Almost all of the researches in this area assumed that setup times and costs are sequence –independent even though sequence dependent setups are common in practice. In this paper we present a new mixed integer non linear program (MINLP) and a heuristic method to solve the problem in sequence dependent case. Furthermore, a genetic algorithm has been developed which applies this constructive heuristic to generate initial population. These two proposed solution methods are compared on randomly generated problems. Computational results show a clear superiority of our proposed GA for majority of the test problems.

متن کامل [PDF 226 kb]   (1829 دریافت)    
نوع مطالعه: پژوهشي | موضوع مقاله: و موضوعات مربوط
دریافت: ۱۳۸۸/۵/۱۱ | پذیرش: ۱۳۹۳/۴/۳۰ | انتشار: ۱۳۹۳/۴/۳۰

Cited by [1] [PDF 96 KB]  (124 دریافت)
ارسال نظر درباره این مقاله : نام کاربری یا پست الکترونیک شما:
کد امنیتی را در کادر بنویسید

ارسال پیام به نویسنده مسئول


کلیه حقوق این وب سایت متعلق به نشریه بین المللی مهندسی صنایع و تحقیقات تولید می باشد.

طراحی و برنامه نویسی : یکتاوب افزار شرق

© 2015 All Rights Reserved | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb