جلد 19، شماره 4 - ( 9-1387 )                   جلد 19 شماره 4 صفحات 47-56 | برگشت به فهرست نسخه ها


XML English Abstract Print


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

TavakoliMoghadam R, Vasei M. A Single Machine Sequencing Problem with Idle Insert: Simulated Annealing and Branch-and-Bound Methods. IJIEPR. 2008; 19 (4) :47-56
URL: http://ijiepr.iust.ac.ir/article-1-6-fa.html
A Single Machine Sequencing Problem with Idle Insert: Simulated Annealing and Branch-and-Bound Methods. نشریه بین المللی مهندسی صنایع و تحقیقات تولید. 1387; 19 (4) :47-56

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


چکیده:   (4409 مشاهده)

  In this paper, a single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/I/ETmax). Due to the time complexity function, this sequencing problem belongs to a class of NP-hard ones. Thus, a special design of a simulated annealing (SA) method is applied to solve such a hard problem. To compare the associated results, a branch-and-bound (B&B) method is designed and the upper/lower limits are also introduced in this method. To show the effectiveness of these methods, a number of different types of problems are generated and then solved. Based on the results of the test problems, the proposed SA has a small error, and computational time for achieving the best result is very small.

متن کامل [PDF 128 kb]   (1093 دریافت)    
نوع مطالعه: پژوهشي | موضوع مقاله: Material Managment
دریافت: ۱۳۸۸/۱/۲۹

ارسال نظر درباره این مقاله : نام کاربری یا پست الکترونیک شما:
کد امنیتی را در کادر بنویسید

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

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

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

Designed & Developed by : Yektaweb