Pub Date : 2019-04-24DOI: 10.1504/IJMOR.2019.10020781
S. Sinha, N. Modak
One of the major reasons behind the abnormal increase of Earth's temperature is the uncontrollable emission of CO2 of production houses. Industrialists are very much interested to enhance their profit only instead of greater interest of the society. The paper develops an economic production quantity (EPQ) model reckoning the aspects of carbon emission and carbon trading. A production house has to pay compulsory tax for carbon emission and incurs a penalty cost for the emission of excess carbon dioxide than its permissible limit. The producer is able to earn revenue by the way of carbon trading by controlling carbon emission within the permissible limit. Plantation of trees can effectively mitigate emission. Numerical examples are given to illustrate the validity of the proposed model and comparison of result between with and without plantation is provided. Comprehensive sensitivity analysis of various parameters has also been carried out.
{"title":"An EPQ model in the perspective of carbon emission reduction","authors":"S. Sinha, N. Modak","doi":"10.1504/IJMOR.2019.10020781","DOIUrl":"https://doi.org/10.1504/IJMOR.2019.10020781","url":null,"abstract":"One of the major reasons behind the abnormal increase of Earth's temperature is the uncontrollable emission of CO2 of production houses. Industrialists are very much interested to enhance their profit only instead of greater interest of the society. The paper develops an economic production quantity (EPQ) model reckoning the aspects of carbon emission and carbon trading. A production house has to pay compulsory tax for carbon emission and incurs a penalty cost for the emission of excess carbon dioxide than its permissible limit. The producer is able to earn revenue by the way of carbon trading by controlling carbon emission within the permissible limit. Plantation of trees can effectively mitigate emission. Numerical examples are given to illustrate the validity of the proposed model and comparison of result between with and without plantation is provided. Comprehensive sensitivity analysis of various parameters has also been carried out.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132564893","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-24DOI: 10.1504/IJMOR.2019.10020780
A. Ebrahimnejad, S. Ziari
One of the difficulties of data envelopment analysis (DEA) is the problem of deficiency discrimination among efficient decision making units (DMUs) and hence, yielding large number of DMUs as efficient ones. The main purpose of this paper is to overcome this inability. One of the methods for ranking efficient DMUs is minimising the coefficient of variation (CV) for inputs-outputs weights, which, was suggested by Bal et al. (2008). In this paper, we introduce a nonlinear model for ranking efficient DMUs based on modifying of the model suggested by Bal et al. and then we convert the nonlinear model proposed into a linear programming form. The motivation of this work is to linearise the existing nonlinear model which has the computational complexity.
{"title":"New model for improving discrimination power in DEA based on dispersion of weights","authors":"A. Ebrahimnejad, S. Ziari","doi":"10.1504/IJMOR.2019.10020780","DOIUrl":"https://doi.org/10.1504/IJMOR.2019.10020780","url":null,"abstract":"One of the difficulties of data envelopment analysis (DEA) is the problem of deficiency discrimination among efficient decision making units (DMUs) and hence, yielding large number of DMUs as efficient ones. The main purpose of this paper is to overcome this inability. One of the methods for ranking efficient DMUs is minimising the coefficient of variation (CV) for inputs-outputs weights, which, was suggested by Bal et al. (2008). In this paper, we introduce a nonlinear model for ranking efficient DMUs based on modifying of the model suggested by Bal et al. and then we convert the nonlinear model proposed into a linear programming form. The motivation of this work is to linearise the existing nonlinear model which has the computational complexity.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128418198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-24DOI: 10.1504/IJMOR.2019.10020779
M. Abdel-Baset, Yongquan Zhou, Ibrahim M. Hezam
The sine cosine algorithm (SCA) is one of the most recent nature-inspired meta-heuristic optimisation algorithm, which the mathematical model based on sine and cosine functions. SCA has validated excellent performance in solving continuous problems and engineering optimisation problems. In this paper, we propose a new algorithm that encompasses the features of sine cosine algorithm and Simpson method (SCA-SM). The proposed procedure consists of two phases: in the first phase, the of sine cosine algorithm are used to find the optimal segmentation points on the integral interval of an integrand. In the second phase, the approximate integral value of the integrand is then calculated by a Simpson method. Numerical simulation results show that the algorithm offers an effective way to calculate numerical value of definite integrals, and it has a high convergence rate, high accuracy and robustness.
{"title":"Use of a sine cosine algorithm combined with Simpson method for numerical integration","authors":"M. Abdel-Baset, Yongquan Zhou, Ibrahim M. Hezam","doi":"10.1504/IJMOR.2019.10020779","DOIUrl":"https://doi.org/10.1504/IJMOR.2019.10020779","url":null,"abstract":"The sine cosine algorithm (SCA) is one of the most recent nature-inspired meta-heuristic optimisation algorithm, which the mathematical model based on sine and cosine functions. SCA has validated excellent performance in solving continuous problems and engineering optimisation problems. In this paper, we propose a new algorithm that encompasses the features of sine cosine algorithm and Simpson method (SCA-SM). The proposed procedure consists of two phases: in the first phase, the of sine cosine algorithm are used to find the optimal segmentation points on the integral interval of an integrand. In the second phase, the approximate integral value of the integrand is then calculated by a Simpson method. Numerical simulation results show that the algorithm offers an effective way to calculate numerical value of definite integrals, and it has a high convergence rate, high accuracy and robustness.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"194 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121119865","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-04-24DOI: 10.1504/IJMOR.2019.099387
Z. Al-Hemyari, H. A. Al-Dabag, Ali Al-Humairi
Utilising the prior information or additional information from the past in new estimation processes has been receiving considerable attention in the last few decades - as such appears from the list of the references of this paper. In fact, the shrinkage testimators were developed originally for the purpose of utilising the prior information in new estimation problems. In this paper, we have developed a general class of shrinkage testimator, and because it always uses the prior value, are called the always pooling shrinkage testimator for any parameter or distribution. The expressions of bias, risk, risk ratio, relative efficiency, region and shrinkage weight function are derived. The dual importance of the proposed class of testimators are in using the prior information in both stages, something which has significant influence in increasing the relative efficiency and reduction of the sample size required. The comparisons, recommendations, discussions and limitations are provided in this paper.
{"title":"A class of always pooling shrinkage testimators for the Weibull model","authors":"Z. Al-Hemyari, H. A. Al-Dabag, Ali Al-Humairi","doi":"10.1504/IJMOR.2019.099387","DOIUrl":"https://doi.org/10.1504/IJMOR.2019.099387","url":null,"abstract":"Utilising the prior information or additional information from the past in new estimation processes has been receiving considerable attention in the last few decades - as such appears from the list of the references of this paper. In fact, the shrinkage testimators were developed originally for the purpose of utilising the prior information in new estimation problems. In this paper, we have developed a general class of shrinkage testimator, and because it always uses the prior value, are called the always pooling shrinkage testimator for any parameter or distribution. The expressions of bias, risk, risk ratio, relative efficiency, region and shrinkage weight function are derived. The dual importance of the proposed class of testimators are in using the prior information in both stages, something which has significant influence in increasing the relative efficiency and reduction of the sample size required. The comparisons, recommendations, discussions and limitations are provided in this paper.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132122635","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-02-08DOI: 10.1504/IJMOR.2019.097760
Dharamender Singh
This paper deals, production-inventory model with stock-dependent and selling price dependent demand. Demand rate is linearly increasing with stock and time, decreasing with a selling price of the item. Shortages are allowed and partially back ordered at the rate of decreasing waiting time of next replenishment. This model is classified as the deterioration rate is constant, and holding cost-based as constant. The model is solved numerically and analytically by minimising the total inventory cost and maximises the total profit at the last sensitivity analysis has been performed to show the nature of model in every parameter on the optimum solution. We have presented a solution-search procedure to find the preservation technology and optimal production time.
{"title":"Production inventory model of deteriorating items with holding cost, stock, and selling price with backlog","authors":"Dharamender Singh","doi":"10.1504/IJMOR.2019.097760","DOIUrl":"https://doi.org/10.1504/IJMOR.2019.097760","url":null,"abstract":"This paper deals, production-inventory model with stock-dependent and selling price dependent demand. Demand rate is linearly increasing with stock and time, decreasing with a selling price of the item. Shortages are allowed and partially back ordered at the rate of decreasing waiting time of next replenishment. This model is classified as the deterioration rate is constant, and holding cost-based as constant. The model is solved numerically and analytically by minimising the total inventory cost and maximises the total profit at the last sensitivity analysis has been performed to show the nature of model in every parameter on the optimum solution. We have presented a solution-search procedure to find the preservation technology and optimal production time.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115933028","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-02-08DOI: 10.1504/IJMOR.2019.097753
R. Udayakumar, K. Geetha
In this article, we discuss a production-distribution inventory model with a single-vendor and single buyer under imperfect production process. Trade credit is offered by the supplier, who encourages the retailer to buy more products. The lead time and the vendor's setup cost are reduced by an added cost. Two models are proposed in this article. In the first model, the lead time demand is allowed to follow a normal distribution and another model is framed with distribution free lead time demand. The objective of this work is to frame the model under imperfect production process and delay in payment and to investigate the impact of product defective rate on the expected total cost of the integrated system. The optimal values of order quantity, lead time, setup cost and the number of shipments from vendor to the buyer are found. Efficient computational algorithms for both the models are designed and managerial insights are obtained.
{"title":"A two-level supply chain model with trade credit and imperfect production process","authors":"R. Udayakumar, K. Geetha","doi":"10.1504/IJMOR.2019.097753","DOIUrl":"https://doi.org/10.1504/IJMOR.2019.097753","url":null,"abstract":"In this article, we discuss a production-distribution inventory model with a single-vendor and single buyer under imperfect production process. Trade credit is offered by the supplier, who encourages the retailer to buy more products. The lead time and the vendor's setup cost are reduced by an added cost. Two models are proposed in this article. In the first model, the lead time demand is allowed to follow a normal distribution and another model is framed with distribution free lead time demand. The objective of this work is to frame the model under imperfect production process and delay in payment and to investigate the impact of product defective rate on the expected total cost of the integrated system. The optimal values of order quantity, lead time, setup cost and the number of shipments from vendor to the buyer are found. Efficient computational algorithms for both the models are designed and managerial insights are obtained.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116044987","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-02-08DOI: 10.1504/IJMOR.2019.097759
S. Sajadi, A. Alizadeh, M. Zandieh, F. Tavan
In this paper, robust and stable scheduling for a flexible job-shop problem with random machine breakdowns has been discussed. A two-stage genetic algorithm is used to generate the predictive schedule. The first stage optimises the primary objective, which minimises the makespan, where all data is considered to be deterministic with no expected disruptions. The second stage optimises two objectives, makespan and stability, function in the presence of random machine breakdowns. For the second stage two different versions of multi-objective genetic algorithm, non-dominated sorting genetic algorithm II and non-dominated ranking genetic algorithm, is used. A simulator is proposed to simulate random machine breakdowns. An experimental study and analysis of variance is conducted to study the results of each multi-objective algorithm and breakdown simulator. The results of their comparison indicate that, non-dominated ranking genetic algorithm (NRGA) performs better and also shows a significant difference between various repair times in the proposed breakdown simulator.
{"title":"Robust and stable flexible job shop scheduling with random machine breakdowns: multi-objectives genetic algorithm approach","authors":"S. Sajadi, A. Alizadeh, M. Zandieh, F. Tavan","doi":"10.1504/IJMOR.2019.097759","DOIUrl":"https://doi.org/10.1504/IJMOR.2019.097759","url":null,"abstract":"In this paper, robust and stable scheduling for a flexible job-shop problem with random machine breakdowns has been discussed. A two-stage genetic algorithm is used to generate the predictive schedule. The first stage optimises the primary objective, which minimises the makespan, where all data is considered to be deterministic with no expected disruptions. The second stage optimises two objectives, makespan and stability, function in the presence of random machine breakdowns. For the second stage two different versions of multi-objective genetic algorithm, non-dominated sorting genetic algorithm II and non-dominated ranking genetic algorithm, is used. A simulator is proposed to simulate random machine breakdowns. An experimental study and analysis of variance is conducted to study the results of each multi-objective algorithm and breakdown simulator. The results of their comparison indicate that, non-dominated ranking genetic algorithm (NRGA) performs better and also shows a significant difference between various repair times in the proposed breakdown simulator.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130618342","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-02-08DOI: 10.1504/IJMOR.2019.097755
Karol Rosen
We present a result characterising the large deviations behaviour of the total overflow level in a cycle starting with zero customers for a system of G/G/1 queues in series. We also present large deviations results for the total overflow level as seen by a random customer and in stationarity. We prove that the large deviations behaviour of the total overflow level for all three distributions, in a cycle, as seen by a random customer and in stationarity, have the same decay rate. We find the most likely path to have overflow in the system. Based on those results we propose a state-independent importance sampling algorithm. We also give conditions under which that algorithm is asymptotically efficient. By means of numerical simulation, we provide evidence of the advantages of this algorithm.
{"title":"Large deviations for the overflow level of G/G/1 queues in series","authors":"Karol Rosen","doi":"10.1504/IJMOR.2019.097755","DOIUrl":"https://doi.org/10.1504/IJMOR.2019.097755","url":null,"abstract":"We present a result characterising the large deviations behaviour of the total overflow level in a cycle starting with zero customers for a system of G/G/1 queues in series. We also present large deviations results for the total overflow level as seen by a random customer and in stationarity. We prove that the large deviations behaviour of the total overflow level for all three distributions, in a cycle, as seen by a random customer and in stationarity, have the same decay rate. We find the most likely path to have overflow in the system. Based on those results we propose a state-independent importance sampling algorithm. We also give conditions under which that algorithm is asymptotically efficient. By means of numerical simulation, we provide evidence of the advantages of this algorithm.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115412441","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-02-08DOI: 10.1504/IJMOR.2019.097758
Yogita Kansal, P. K. Kapur, U. Kumar, Deepak Kumar
Risk assessment and management are the necessary actions performed by software developing organizations to ensure the continuity of the product in case of vulnerabilities. Clustering vulnerabilitie ...
风险评估和管理是软件开发组织为确保产品在漏洞情况下的连续性而执行的必要操作。集群漏洞…
{"title":"Prioritising vulnerabilities using ANP and evaluating their optimal discovery and patch release time","authors":"Yogita Kansal, P. K. Kapur, U. Kumar, Deepak Kumar","doi":"10.1504/IJMOR.2019.097758","DOIUrl":"https://doi.org/10.1504/IJMOR.2019.097758","url":null,"abstract":"Risk assessment and management are the necessary actions performed by software developing organizations to ensure the continuity of the product in case of vulnerabilities. Clustering vulnerabilitie ...","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117348013","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-02-08DOI: 10.1504/IJMOR.2019.097756
G. Ayyappan, S. Karpagam
In this paper, we discuss a non-Markovian batch arrival general bulk service single server queueing system with server breakdown and repair, single vacation and stand-by server. There is a stand-by server which is employed during the period for which the regular server remains under repair. Both the servers serve the customer under general bulk service rule. Suppose at the instant main servers service completion if the queue length is less than 'a' then the main server goes for a vacation. Suppose at the instant of repair completion or vacation completion if the system size is less than 'a' then the main server stays in the system and waits for the next batch of arriving customers. The probability generating function of queue size at an arbitrary time and some performance measures of the system are derived. An extensive numerical result for a particular case of the model is illustrated.
{"title":"An M[X]/G(a, b)/1 queueing system with server breakdown and repair, stand-by server and single vacation","authors":"G. Ayyappan, S. Karpagam","doi":"10.1504/IJMOR.2019.097756","DOIUrl":"https://doi.org/10.1504/IJMOR.2019.097756","url":null,"abstract":"In this paper, we discuss a non-Markovian batch arrival general bulk service single server queueing system with server breakdown and repair, single vacation and stand-by server. There is a stand-by server which is employed during the period for which the regular server remains under repair. Both the servers serve the customer under general bulk service rule. Suppose at the instant main servers service completion if the queue length is less than 'a' then the main server goes for a vacation. Suppose at the instant of repair completion or vacation completion if the system size is less than 'a' then the main server stays in the system and waits for the next batch of arriving customers. The probability generating function of queue size at an arbitrary time and some performance measures of the system are derived. An extensive numerical result for a particular case of the model is illustrated.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130071296","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：