کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
5082935 1477652 2006 15 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Two-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی مهندسی صنعتی و تولید
پیش نمایش صفحه اول مقاله
Two-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times
چکیده انگلیسی
The two-machine flowshop scheduling problem is addressed where setup times are considered as separate from processing times and where the objective is to minimize total completion time. All setup and processing times on both machines are unknown variables (before the actual occurrence of these times) where the only known information is the lower and upper bounds for both setup and processing times of each job. In such an environment, there may not exist a unique schedule that remains optimal for all possible realizations of setup and processing times, and therefore, a set of dominating schedules (which dominate all other schedules) has to be obtained. The objective in such a scheduling environment is to reduce the size of dominating schedules set. Two dominance relations are developed for the considered problem. Illustrative numerical examples are given and computational experiments on randomly generated problems are conducted. The computational experiments show that the developed dominance relations are quite helpful in reducing the size of dominating schedules.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: International Journal of Production Economics - Volume 103, Issue 1, September 2006, Pages 386-400
نویسندگان
,