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

به حداقل رساندن زمان اتمام کل در برنامه ریزی یک ماشین با در نظر گرفتن تاثیرات فرسودگی / تخریب و فعالیت های تعمیر و نگهداری مخرب

کد مقاله سال انتشار مقاله انگلیسی ترجمه فارسی تعداد کلمات
21614 2010 9 صفحه PDF سفارش دهید محاسبه نشده
خرید مقاله
پس از پرداخت، فوراً می توانید مقاله را دانلود فرمایید.
عنوان انگلیسی
Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities
منبع

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

Journal : Computers & Mathematics with Applications, Volume 60, Issue 7, October 2010, Pages 2161–2169

کلمات کلیدی
برنامه ریزی - اثر پیری - اثر فرسودگی - فعالیت های تعمیر و نگهداری مخرب - کل زمان تکمیل
پیش نمایش مقاله
پیش نمایش مقاله  به حداقل رساندن زمان اتمام کل در برنامه ریزی یک ماشین با در نظر گرفتن تاثیرات  فرسودگی / تخریب و فعالیت های تعمیر و نگهداری مخرب

چکیده انگلیسی

In a real manufacturing system, a machine may need multiple maintenance activities to improve its production efficiency due to the effects of aging or deteriorating. This paper considers scheduling with aging or deteriorating effects and deteriorating maintenance activities simultaneously on a single machine. We assume that the machine may be subject to several maintenance activities during the planning horizon. However, due to the restriction of budget of maintenance, the upper bound of the maintenance frequency on the machine is assumed to be known in advance. Moreover, we assume that the duration of each maintenance activity depends on the running time of the machine. The objective is to find jointly the optimal maintenance frequencies, the optimal maintenance positions, and the optimal job sequence for minimizing the total completion time. We show that all the problems studied are polynomially solvable.

مقدمه انگلیسی

Most production scheduling assumes that a machine is continuously available during the planning horizon. However, in a real production system, the machine may not be available because of preventive maintenance, tool changes, or breakdowns. Scheduling with maintenance to improve the machine’s efficiency has received increasing attention in the last two decades. During the maintenance, the machine is unavailable for processing jobs. This problem has been classified as machine scheduling with availability constraint. For a complete list of studies, the reader may refer to the comprehensive surveys by Schmidt [1] and Ma et al. [2]. Due to the practical experience in production systems, scheduling with considerations of the learning, aging, or deteriorating effects has been one of the most popular topics among researchers in recent years. The actual processing times of jobs may vary due to the learning, aging, or deteriorating effects. For details on this stream of research, the reader may refer to the comprehensive surveys by Alidaee and Womer [3], Cheng et al. [4], Bachman and Janiak [5], Janiak and Kovalyov [6], Janiak and Rudek [7], Biskup [8], Janiak and Rudek [9], and the recent book by Gawiejnowicz [10]. Additionally, in order to model a more realistic manufacturing setting, several studies have considered the aging or deteriorating effect and maintenance simultaneously in scheduling problems. Wu and Lee [11] studied a single-machine scheduling with an availability constraint under linearly deteriorating jobs and a resumable condition. The aim was to find an optimal schedule for minimizing the makespan. Ji et al. [12] investigated the same problem as was proposed by Wu and Lee [11] under a non-resumable condition with the objectives of minimizing the makespan and the total completion time. Lee and Wu [13] further studied multi-machine scheduling problems with deteriorating jobs and an availability constraint. Both the resumable and the non-resumable cases were studied with the objective of minimizing the makespan. Low et al. [14] considered a single-machine scheduling with an availability constraint to minimize the makespan under a simple linear deteriorating assumption. Lodree and Geiger [15] explored a single-machine scheduling with time-dependent processing times and a rate-modifying activity. The aim was to derive the optimal policy for assigning the rate-modifying activity in a sequence to minimize the makespan. Gawiejnowicz and Kononov [16] studied a single-machine scheduling with simultaneous considerations of time-dependent deteriorating jobs and availability constraint in a resumable situation to minimize the makespan. Yang et al. [17] investigated a due-window assignment scheduling problem on a single machine under a job-dependent aging effect and maintenance activity considerations simultaneously. The goal was to find jointly the optimal maintenance position, the optimal due-window position, and the optimal job sequence to minimize a total cost function. Those papers which consider scheduling problems with the aging or deteriorating effect and the maintenance activity assumed that at most one maintenance activity is undertaken on each machine throughout the planning horizon. However, in a real production setting, a machine may need to be maintained more than once to improve its production efficiency. Therefore, a more realistic machine scheduling model should be taken into consideration associated with multiple maintenance activities for a machine. However, research on scheduling with simultaneous considerations of aging or deteriorating effects and multiple maintenance activities has not been studied until recently. Gawiejnowicz [18] considered two problems of scheduling a set of independent, non-preemptive and proportionally deteriorating jobs on a single machine, with constraints on availability of the machine or jobs. The objective was to minimize the makespan. Kuo and Yang [19] investigated a single-machine scheduling with a cyclic process of aging effects and multiple maintenance activities. They stressed the makespan problem with job-independent and position-dependent aging effects, respectively. Later, Zhao and Tang [20] extended the study of Kuo and Yang [19] to the case with job-dependent aging effects. Yang and Yang [21] studied a single-machine scheduling with the job-dependent aging effects under multiple maintenance activities and variable maintenance duration considerations simultaneously to minimize the makespan. To the best of our knowledge, however, the scheduling with simultaneous considerations of aging or deteriorating effects and multiple maintenance activities for minimizing the total completion time has never been explored. Furthermore, apart from Kubzin and Strusevich [22] and [23], Mosheiov and Sidney [24], Yang et al. [17], and Yang and Yang [21], scheduling with variable maintenance duration has rarely been studied. In a real manufacturing system, however, the machine maintenance duration may depend on the running time of the machine in that the later maintenance activity is performed, the worse the machine conditions are, and a longer time is needed to perform the maintenance activity. This kind of maintenance activity can be considered as a deteriorating maintenance activity. Consequently, this paper considers the scheduling with aging or deteriorating effects and multiple maintenance activities simultaneously on a single machine. The upper bound of the maintenance frequency on the machine due to the restriction of budget of maintenance is assumed to be known in advance. In addition, we assume that the duration of each maintenance activity depends on the running time of the machine. The objective is to find jointly the optimal maintenance frequencies, the optimal maintenance positions, and the optimal job sequence for minimizing the total completion time. We will show that all the problems studied can be optimally solved using polynomial time algorithms. The remainder of this paper is organized as follows. In Section 2, we formulate the problems under study. In Section 3, we present several important preliminary properties if there is no maintenance scheduled in the sequence. In Section 4, we provide polynomial time solutions for all the problems studied. We conclude with the findings in the last section.

نتیجه گیری انگلیسی

In this paper we considered a single-machine scheduling with aging or deteriorating effects and deteriorating maintenance activities simultaneously. The objective is to minimize the total completion time when the upper bound of the maintenance frequency is given in advance. We showed that the problem under study is polynomially solvable. Table 2 lists the time complexity results for various cases of the problem. Further research may investigate the problem with other models of maintenance duration, in multi-machine settings, and optimizing other performance measures.

خرید مقاله
پس از پرداخت، فوراً می توانید مقاله را دانلود فرمایید.