کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
479385 1446228 2006 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation
چکیده انگلیسی

The paper deals with the classical problem of minimizing the makespan in a two-machine flow shop. When the job processing times are deterministic, the optimal job sequence can be determined by applying Johnson’s rule. When they are independent and exponential random variables, Talwar’s rule yields a job sequence that minimizes the makespan stochastically.Assuming that the job processing times are independently and Weibull distributed random variables, we present a new job sequencing rule that includes both Johnson’s and Talwar’s rules as special cases. The proposed rule is applicable as a heuristic whenever the job processing times are characterized by their means and the same coefficient of variation. Simulation results show that it leads to very encouraging results when the expected makespan is minimized.

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