دانلود مقاله ISI انگلیسی شماره 21612
ترجمه فارسی عنوان مقاله

برنامه ریزی مشکلات با فعالیت های نگهداری مختلف و شغل های غیر پیشگیرانه در دو دستگاه موازی یکسان

عنوان انگلیسی
Scheduling problems with multiple maintenance activities and non-preemptive jobs on two identical parallel machines
کد مقاله سال انتشار تعداد صفحات مقاله انگلیسی
21612 2010 8 صفحه PDF
منبع

Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)

Journal : International Journal of Production Economics, Volume 124, Issue 1, March 2010, Pages 151–158

ترجمه کلمات کلیدی
- برنامه ریزی - دو دستگاه موازی - ایجاد فاصله - زمان کل تکمیل - تعمیر و نگهداری چندگانه - مشکل بسته بندی زباله
کلمات کلیدی انگلیسی
Scheduling,Two parallel machine,Makespan,Total completion time,Multiple maintenance,Bin-packing problem
پیش نمایش مقاله
پیش نمایش مقاله  برنامه ریزی مشکلات با فعالیت های نگهداری مختلف و شغل های غیر پیشگیرانه در دو دستگاه موازی یکسان

This paper deals with the problem of processing a set of n jobs on two identical parallel machines. In order to reduce the probability of machine breakdown with minor sacrifices in production time, the machines cannot process the jobs consecutively, they need to be maintained regularly (here we assume that the largest consecutive working time for each machine cannot exceed an upper limit T ). Two scheduling models are considered. In the first model, the maintenance activities are performed periodically and the objective is to schedule the jobs on two machines such that the makespan is minimized. In the second model, the maintenance activities are determined jointly with the scheduling of jobs, and the objective is to minimize the total completion time of jobs. For the first problem, we introduce an O(n2)O(n2) time algorithm named MHFFDMHFFD and show that the performance ratio of MHFFDMHFFD is at most max{1.6+1.2σ,2}max{1.6+1.2σ,2}, where σ≜t/Tσ≜t/T, t is the amount of time to perform each maintenance activity. For the second problem, we apply the classical SPT algorithm to it and show that the worst-case bound of SPT algorithm is no more than 1+2σ1+2σ. We also point out that for the case of single machine, if the SPT schedule has three batches, then the upper bound of SPT algorithm can be reduced from the known result 21/17 to 11/9 under the assumption that t<Tt<T.