کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
479383 1446228 2006 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A new sufficient condition of optimality for the two-machine flowshop problem
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
A new sufficient condition of optimality for the two-machine flowshop problem
چکیده انگلیسی

This paper focuses on the characterization of a subset of optimal sequences for the famous two-machine flowshop problem. Based on the relative order of the job processing times, two particular interval structures are defined so that each job is associated with an interval. Then, using the Allen’s algebra, the interval relationships are analysed and a sufficient optimality condition is established providing a characterization of a large subset of optimal sequences. This set necessarily includes any Johnson’s sequences together with numerous other optimal job sequences.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 169, Issue 3, 16 March 2006, Pages 712–722
نویسندگان
, , ,