دانلود رایگان مقاله لاتین برنامه ریزی موازی اختلالات ماشین بالقوه از سایت الزویر
عنوان فارسی مقاله:
برنامه ریزی موازی ماشین بدتر شدن کارها با اختلالات ماشین بالقوه
عنوان انگلیسی مقاله:
Parallel-machine scheduling of deteriorating jobs with potential machine disruptions
سال انتشار : 2017
برای دانلود رایگان مقاله برنامه ریزی موازی اختلالات ماشین بالقوه اینجا کلیک نمایید.
بخشی از مقاله انگلیسی:
2. Problem formulation
We formally describe the general problem under consideration as follows: There are n independent jobs in the job set N ¼ fJ1; J2; …; Jng to be processed on m identical parallel machines M1; M2; …; Mm over a scheduling period T. All the n jobs are available for processing at time zero. Each job needs to be processed on one machine only and each machine is capable of processing any job but at most one job at a time. The machines will experience deterioration in efficiency due to usage and aging [26]. As a result of deterioration in machine efficiency over time, the actual processing time of a job will become longer if it is scheduled for processing later. Specifically, if job Jj is processed on machine Mi and starts processing at time t, we define its actual processing time as pjt ¼ pjð1þatÞ, where pj is the normal processing time of job Jj and a (a40) is the deteriorating rate common to all the jobs. Some of the m machines may become unavailable due to potential machine disruptions, each of which will last for a period of time with a certain probability. Without loss of generality, we assume that a machine disruption will happen at time r, which makes the first ι machines M1; …; Mι, 1rιrm, unavailable and the duration will take γ (γ ¼ 0; 1; …; s) time units with a probability ζγ , which is the same for all the disrupted machines once the anticipated disruption occurs. Here, ζ0 is the probability that the disruption will not happen and s is the maximum possible duration. In order to reduce the effect of machine deterioration, an option strategy is to perform machine maintenance, which will improve the efficiency of the machine by making it return to its original state of efficiency. It follows that the actual processing time of job Jj will be the same as its normal processing time if it is the first job that starts processing on a repaired machine after maintenance. However, we focus on the case where the effect of machine deterioration on the objective value during the scheduling period is smaller compared with the cost incurred from the maintenance duration and the maintenance cost, which is reasonable in most production and service systems. As a consequence, we consider the following two cases: Case 1: Perform maintenance immediately on each of the disrupted machines with a fixed duration, denoted by κ, when a disruption occurs by several maintenance workers (or teams). Thus, the disrupted machines will become unavailable during the time interval ½r;r þmaxfγ; κg under the scenario γ (γZ1). Case 2: Do not perform machine maintenance. The reason for considering Case 1 is twofold. One is that it may reduce the effect on the objective value caused by machine disruptions because performing maintenance can improve the efficiency of the machines. The other is that it may reduce the effect on the objective value caused by performing maintenance because disrupted machines have unavailable time intervals due to machine disruptions, which can reduce the effect from maintenance duration. In each case, we consider both the resumable and non-resumable cases. If a job is disrupted during processing by a disrupted machine and it does not need (needs) to re-start after the machine becomes available again, it is called the resumable (non-resumable) case (see [12]). Assume that the last job started before but not completed at r is job Jj. In the nonresumable case, Jj needs to re-start at times rþmaxfγ; κg and rþγ for Case 1 and Case 2, respectively, under scenario γZ1, while in the resumable case, processing of the remaining part of Jj will continue at times rþmaxfγ; κg and rþγ for Case 1 and Case 2, respectively, without any penalty. We assume throughout the paper that pj, r, s, and κ are known positive integers such that κrs and a is chosen such that apj is a positive integer for all j ¼ 1; …; n. The objective is to determine an optimal schedule to minimize the expected total completion time of the jobs, i.e., Eð Pn j ¼ 1 CjÞ, where Cj denotes the completion time of job Jj in a given sequence.
برای دانلود رایگان مقاله برنامه ریزی موازی اختلالات ماشین بالقوه اینجا کلیک نمایید.
کلمات کلیدی:
Automation and anxiety - The Economist https://www.economist.com/.../21700758-will-smarter-machines-cause-mass-unemplo... Jun 25, 2016 - Artificial intelligence: The impact on jobsAutomation and anxiety. Will smarter machines cause mass unemployment? ... 702 occupations and found that 47% of workers in America had jobs at high risk of potential automation. Scheduling linear deteriorating jobs to minimize the number of tardy ... link.springer.com/article/10.1007/s10898-011-9767-1 In this paper a problem of scheduling a single machine under linear deterioration which aims at minimizing the number of tardy jobs is considered. According to ... Sparrho | Parallel-machine scheduling of deteriorating jobs with pote https://www.sparrho.com/...machine...jobs-with-potential-machine-disruptions.../960f... Parallel-machine scheduling of deteriorating jobs with potential machine disruptions ☆. Imported: 05 Aug '16 | Published: 04 Aug '16. Yunqiang Yin, Yan Wang, ... Algorithms - ESA '98: 6th Annual European Symposium, Venice, Italy, ... https://books.google.com/books?isbn=3540685308 Gianfranco Bilardi, Giuseppe F. Italiano, Andrea Pietracaprina - 2003 - Computers For each job we must decide either to schedule that job (on a machine that ... account a variety of factors such as inventory, potential machine disruptions, etc. Where machines could replace humans--and where they can't (yet ... www.mckinsey.com/.../where-machines-could-replace-humans-and-where-they-cant-... The technical potential for automation differs dramatically across sectors and activities. ... guessing game: which jobs will or won't be replaced by machines? Handbook of Scheduling: Algorithms, Models, and Performance Analysis https://books.google.com/books?isbn=0203489802 Joseph Y-T. Leung - 2004 - Computers For example, for E[Ci] problem, it is optimal to sequence jobs in the SPT order. ... models focus on job scheduling with potential uncertain machine breakdown. ... (v) When facing breakdown disruptions, the original scheduling plans are rarely ... Searches related to jobs with potential machine disruptions digital disruption what is digital disruption australia digital disruption definition digital disruption pdf digital disruption examples abc news
