期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
N-policy for M^(x)/G/1 Unreliable Retrial G-Queue with Preemptive Resume and Multi-services
1
作者 Amita Bhagat Madhu Jain 《Journal of the Operations Research Society of China》 EI CSCD 2016年第4期437-459,共23页
Bulk arrival retrial G-queue with impatient customers and multi-servicessubject to server breakdowns has been analyzed. The system allows the arrival oftwo types of customers: positive customers and negative customers... Bulk arrival retrial G-queue with impatient customers and multi-servicessubject to server breakdowns has been analyzed. The system allows the arrival oftwo types of customers: positive customers and negative customers in the system.The negative customers make the server fail if they find the server in busy state,whereas positive customers are served if the server is idle otherwise they join thevirtual pool of customers called orbit. The customers from the retrial orbit try theirchance again for the service. The customers have the option of obtaining more than oneservice. Moreover, the customers are impatient and may renege from the system withprobability (1−r ). The server is sent for repair as soon as it breakdowns;after repair,the service process starts again. Also, the server has the provision to initiate the servicewhen there areN customers accumulated in the system. Using supplementary variablestechnique and generating functions, various performance measures like reliabilityindices and long run probabilities have been obtained. 展开更多
关键词 Retrial queue N-policy vacation Negative customers RENEGING Bulk arrival Breakdowns preemptive resume Multi-services
原文传递
Stochastic Scheduling on an Unreliable Machine with General Uptimes and General Set-UpTimes
2
作者 LI Wei CAO Jinhua(Institute of Applied Mathematics,Chinese Academy of Sciences,Beijing 100080)(Open Laboratory on the Complex System Control,Institute of Automation,Chinese Academy of Sciences,Beijing 100080) 《Systems Science and Systems Engineering》 CSCD 1994年第3期279-288,共10页
A model that,scheduling a set,of stochastic jods on a single machine that is subject to breakdorwn and repair is dicussed.The model assumes that a significant set-up time,which is an arbitrary variable,is when the mac... A model that,scheduling a set,of stochastic jods on a single machine that is subject to breakdorwn and repair is dicussed.The model assumes that a significant set-up time,which is an arbitrary variable,is when the machine changes from processing one of jobs to another job.When job i is being processed, the prooessing time of job i,uptime and reparied time of the machine are all general random variables. For both preemptive resume model and preemptive repeat model,we find the optimal polices that minimize the following objective functions:(1)the weighted sum of the completion times;(2)the weighted number of late jobs having random dud dates with exponential distributions. 展开更多
关键词 Stochastic scheduling set up time preemptive resume model preemptive repeat model
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部