کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5128331 | 1489584 | 2017 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Optimal stationary appointment schedules
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
A prevalent operations research problem concerns the generation of appointment schedules that effectively deal with variation in e.g. service times. In this paper we focus on the situation in which there is a large number of statistically identical customers, leading to an essentially equidistant ('stationary') schedule. We develop a powerful approach that minimizes an objective function incorporating the service provider's idle times and the customers' waiting times. Our main results concern easily computable, or even closed-form, approximations to the optimal schedule with a near-perfect fit. In addition, accurate explicit heavy-traffic approximations are provided, which, as we argue, can be considered as robust.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Operations Research Letters - Volume 45, Issue 6, November 2017, Pages 549-555
Journal: Operations Research Letters - Volume 45, Issue 6, November 2017, Pages 549-555
نویسندگان
Alex Kuiper, Michel Mandjes, Jeroen de Mast,