کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
482810 1446221 2006 22 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Sequencing games with controllable processing times
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Sequencing games with controllable processing times
چکیده انگلیسی

In this paper we study a class of cooperative sequencing games that arise from sequencing situations in which the processing times are not fixed. We obtain two core elements that depend only on the optimal schedule for the grand coalition. Furthermore we show that, although these games are not convex in general, many marginal vectors are core elements. We also consider convexity for special instances of the sequencing situation.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 172, Issue 1, 1 July 2006, Pages 64–85
نویسندگان
,