کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
482750 | 1446217 | 2006 | 23 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Exact solutions to a class of stochastic generalized assignment problems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment of each job to an agent is decided a priori, and once the subset of jobs which have to be executed is known, reassignments can be performed if there are overloaded agents.We construct a convex approximation of the objective function that is sharp at all feasible solutions. We then present three versions of an exact algorithm to solve this problem, based on branch and bound techniques, optimality cuts, and a special purpose lower bound. Numerical results are reported.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 173, Issue 2, 1 September 2006, Pages 465–487
Journal: European Journal of Operational Research - Volume 173, Issue 2, 1 September 2006, Pages 465–487
نویسندگان
Maria Albareda-Sambola, Maarten H. van der Vlerk, Elena Fernández,