جلد 25، شماره 1 - ( 11-1392 )
جلد 25 شماره 1 صفحات 70-65 |
برگشت به فهرست نسخه ها
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Nahavandi N, Asadi Gangraj E. A New Lower Bound for Flexible Flow Shop Problem with Unrelated Parallel Machines. IJIEPR 2014; 25 (1) :65-70
URL: http://ijiepr.iust.ac.ir/article-1-478-fa.html
URL: http://ijiepr.iust.ac.ir/article-1-478-fa.html
A New Lower Bound for Flexible Flow Shop Problem with Unrelated Parallel Machines. نشریه بین المللی مهندسی صنایع و تحقیقات تولید. 1392; 25 (1) :65-70
چکیده: (6337 مشاهده)
Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessment the quality of this heuristic, this paper develop a global lower bound on FFS makespan problems with unrelated parallel machines.
نوع مطالعه: پژوهشي |
موضوع مقاله:
و موضوعات مربوط
دریافت: 1391/9/8 | پذیرش: 1392/4/15 | انتشار: 1392/11/13
دریافت: 1391/9/8 | پذیرش: 1392/4/15 | انتشار: 1392/11/13
| بازنشر اطلاعات | |
 | این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است. |
