کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
10348169 699363 2012 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Two branch-and-bound algorithms for the robust parallel machine scheduling problem
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Two branch-and-bound algorithms for the robust parallel machine scheduling problem
چکیده انگلیسی
Uncertainty is an inevitable element in many practical production planning and scheduling environments. When a due date is predetermined for performing a set of jobs for a customer, production managers are often concerned with establishing a schedule with the highest possible confidence of meeting the due date. In this paper, we study the problem of scheduling a given number of jobs on a specified number of identical parallel machines when the processing time of each job is stochastic. Our goal is to find a robust schedule that maximizes the customer service level, which is the probability of the makespan not exceeding the due date. We develop two branch-and-bound algorithms for finding an optimal solution; the two algorithms differ mainly in their branching scheme. We generate a set of benchmark instances and compare the performance of the algorithms based on this dataset.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 39, Issue 7, July 2012, Pages 1652-1660
نویسندگان
, , ,