Template-Type: ReDIF-Article 1.0 Author-Name: Justin Chirima Author-X-Name-First: Justin Author-X-Name-Last: Chirima Author-Name: Eriyoti Chikodza Author-X-Name-First: Eriyoti Author-X-Name-Last: Chikodza Author-Name: Senelani Dorothy Hove-Musekwa Author-X-Name-First: Senelani Dorothy Author-X-Name-Last: Hove-Musekwa Title: Numerical methods for first order uncertain stochastic differential equations Abstract: Uncertain stochastic calculus is a relatively new sub discipline of mathematics. This branch of mathematical sciences seeks to develop models that capture aleatory and epistemic features of generic uncertainty in dynamical systems. The growth of uncertain stochastic theory has given birth to a novel class of differential equations called uncertain stochastic differential equations (USDEs). Exact and analytic solutions to this family of differential equations are not always available. In such cases, numerical analysis provides a gateway to approximate solutions. This paper examines a Runge-Kutta method for solving USDEs. Before examining and applying the Runge-Kutta method, the paper states and proves the existence and uniqueness theorem. The Runge-Kutta method is then applied to solve an American call option pricing problem. This numerical algorithm proves to be effective and efficient because it produces almost the same results as compared to Chen's analytic formula and the classical Black-Scholes model. Journal: Int. J. of Mathematics in Operational Research Pages: 1-23 Issue: 1 Volume: 16 Year: 2020 Keywords: Runge-Kutta; call option; uncertainty; aleatory; epistemic. File-URL: http://www.inderscience.com/link.php?id=104679 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:1:p:1-23 Template-Type: ReDIF-Article 1.0 Author-Name: R. Sudhesh Author-X-Name-First: R. Author-X-Name-Last: Sudhesh Author-Name: A. Azhagappan Author-X-Name-First: A. Author-X-Name-Last: Azhagappan Title: Transient solution of an M/M/&infin; queue with system's additional tasks and impatient customers Abstract: This paper studies the impatient behaviour in an infinite server queue with additional tasks assigned to the system. Whenever the system becomes empty, the system as a whole is assigned a secondary task of duration <i>U</i> whose distribution is exponential. Any arrival during the period <i>U</i> becomes impatient due to the unavailability of service facility. Each individual waiting customer activates an independent impatience timer of duration <i>T</i> which is exponentially distributed. When the system comes back after the completion of <i>U</i>, before <i>T</i> expires, the waiting customers are simultaneously taken for service and they leave the system after the completion of service. If <i>T</i> expires before the completion of task <i>U</i>, the customers abandon the system and never to return. The transient system size probabilities of this model are derived explicitly for both single and multiple task cases. The time-dependent mean and variance of system size are also derived. Further, numerical simulations are also presented to analyse the effect of system indices. Journal: Int. J. of Mathematics in Operational Research Pages: 82-97 Issue: 1 Volume: 16 Year: 2020 Keywords: infinite server queue; single and multiple tasks; impatient customers; transient probabilities. File-URL: http://www.inderscience.com/link.php?id=104680 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:1:p:82-97 Template-Type: ReDIF-Article 1.0 Author-Name: Massimiliano Caramia Author-X-Name-First: Massimiliano Author-X-Name-Last: Caramia Author-Name: Mattia Dalla Costa Author-X-Name-First: Mattia Dalla Author-X-Name-Last: Costa Title: An application of bilevel optimisation to the waste collection centres location problem Abstract: In this paper, we show an application of bilevel programming to the problem of locating waste collection centres inside a municipal area. In our study, the latter problem possesses a hierarchical structure, i.e., there are two decision makers, one of which acts as a leader and the other behaves as a follower. Therefore, we exhibit a bilevel optimisation program able to capture this hierarchy and propose an iterative algorithm to solve the problem. This solution proposal is then tested on data derived from a real scenario. Experimental results reveal that the approach is effective in this kind of decision problems. Journal: Int. J. of Mathematics in Operational Research Pages: 118-137 Issue: 1 Volume: 16 Year: 2020 Keywords: bilevel programming; facility location; waste collection. File-URL: http://www.inderscience.com/link.php?id=104681 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:1:p:118-137 Template-Type: ReDIF-Article 1.0 Author-Name: J. Arul Valan Author-X-Name-First: J. Arul Author-X-Name-Last: Valan Author-Name: E. Baburaj Author-X-Name-First: E. Author-X-Name-Last: Baburaj Author-Name: P. Parthiban Author-X-Name-First: P. Author-X-Name-Last: Parthiban Title: Data analytics for relative ranking of factors to optimise blood bank supply chain Abstract: Healthcare systems are supported by blood service operations. Restricted usage limit of 21 days and stochastic nature of demand against the supply are the challenges in the field and results in complex situations. The paper focuses on the model mentioned for which a regionalised blood banking system is considered. Typically, it consists of hospitals, regional blood banks, in addition to central blood banks. The 20 factors that influence is weighed and raked using multiple criterion decision making (MCDM) methods. Interpretive structural modelling (ISM) gives the influence of a factor on another and determines weights. Fuzzy-TOPSIS is used to quantify the qualitative values systematically and rank the alternatives. The relative ranking enables to identify best alternative. The procedure for a single central blood bank executed may be extended to similar central blood banks. Supply chain optimisation of perishable products is possible with the framework proposed, with suitable modifications. Journal: Int. J. of Mathematics in Operational Research Pages: 98-117 Issue: 1 Volume: 16 Year: 2020 Keywords: influencing factors; relative ranking; interpretive structural modelling; ISM; fuzzy TOPSIS. File-URL: http://www.inderscience.com/link.php?id=104682 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:1:p:98-117 Template-Type: ReDIF-Article 1.0 Author-Name: Cristhian Chingo Author-X-Name-First: Cristhian Author-X-Name-Last: Chingo Author-Name: Javier Martínez-Gómez Author-X-Name-First: Javier Author-X-Name-Last: Martínez-Gómez Author-Name: Ricardo A. Narváez C. Author-X-Name-First: Ricardo A. Narváez Author-X-Name-Last: C. Title: Material selection using multi-criteria decision making methods for geomembranes Abstract: The present work aims to be a useful information about the novel MCDM methods applied on geomembranes in order to select the best alternative for construction. Qualitative and quantitative information will be used to do the best choice. AHP method is used to calculate the weight (importance) of the different criteria which uses the subjective information to assign numeric values among 0 and 1, being better weights with values near to 1. COPRAS-G, OCRA, TOPSIS, VIKOR, EXPROM II and ORESTE methods are applied as MCDM methods in order to perform the more accurate selection using relevant information about the features of different materials. These methods use the weight obtained by AHP for ranking the best alternative, whose result contains subjective and objective information. Finally, all methods are standardised with a unique equations template, which makes it easier to understand all of them in subsequent applications. Journal: Int. J. of Mathematics in Operational Research Pages: 24-52 Issue: 1 Volume: 16 Year: 2020 Keywords: geomembranes; multi-criteria decision making; MCDM; qualitative; quantitative; standardised; weight. File-URL: http://www.inderscience.com/link.php?id=104683 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:1:p:24-52 Template-Type: ReDIF-Article 1.0 Author-Name: G. Ayyappan Author-X-Name-First: G. Author-X-Name-Last: Ayyappan Author-Name: M. Nirmala Author-X-Name-First: M. Author-X-Name-Last: Nirmala Title: An M[X]/G(a, b)/1 queue with unreliable server, second optional service, closedown, setup with N-policy and multiple vacation Abstract: Batch arrival bulk service queueing system has been effectively used to model many real life systems like production, manufacturing, transportation as well as telecommunication. Characteristic like second optional service, service interruption, closedown time, multiple vacation, setup time with N policy, etc. have been respectively considered in such models. So far, no comprehensive combination of these characteristics have been reported in the literature. This paper deals with the analysis of a non-Markovian batch arrival bulk service queue with a general combination of all the above mentioned characteristics. Journal: Int. J. of Mathematics in Operational Research Pages: 53-81 Issue: 1 Volume: 16 Year: 2020 Keywords: general bulk service; unreliable server; closedown; multiple vacation; setup with N-policy; optional service. File-URL: http://www.inderscience.com/link.php?id=104686 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:1:p:53-81 Template-Type: ReDIF-Article 1.0 Author-Name: Rodger Benjamín Salazar Loor Author-X-Name-First: Rodger Benjamín Salazar Author-X-Name-Last: Loor Author-Name: Javier Martínez-Gómez Author-X-Name-First: Javier Author-X-Name-Last: Martínez-Gómez Author-Name: Juan Carlos Rocha-Hoyos Author-X-Name-First: Juan Carlos Author-X-Name-Last: Rocha-Hoyos Author-Name: Edilberto Antonio LLanes Cedeño Author-X-Name-First: Edilberto Antonio LLanes Author-X-Name-Last: Cedeño Title: Selection of materials by multi-criteria methods applied to the side of a self-supporting structure for light vehicles Abstract: The selection of materials is an important stage in the design and development of products, but considering the enormous amount of materials available on the market that have different properties and characteristics, defining suitable and ideal alternatives is a difficult task. Within the automotive area there is a tendency to develop vehicles with greater efficiency and capacity, keeping aside the economic implications without underestimating the functionality of the materials. The use of multi-criteria methods (MCDM) allows the establishment of a reliable selection methodology, due to the interaction between each of the criteria with statistical methods that converge in a single solution. The methodology used in this study was based on the application of MCDM methods, and the comparison between them to determine a convergence in the alternatives of greater potential for the structural section of vehicles. Four methods were evaluated: TOPSIS, COPRAS, VIKOR, PROMETHEE II, obtaining that for all the methods the best material corresponds to the Martensitic Steel YS1200, being this the most appropriate one when fulfilling structural requirements, as well as providing a reduction of weight and price. Journal: Int. J. of Mathematics in Operational Research Pages: 139-158 Issue: 2 Volume: 16 Year: 2020 Keywords: lateral structure; weighting method; multi-criteria method; MCDM. File-URL: http://www.inderscience.com/link.php?id=105844 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:2:p:139-158 Template-Type: ReDIF-Article 1.0 Author-Name: S.K. Yadav Author-X-Name-First: S.K. Author-X-Name-Last: Yadav Author-Name: Dinesh K. Sharma Author-X-Name-First: Dinesh K. Author-X-Name-Last: Sharma Author-Name: Kate Brown Author-X-Name-First: Kate Author-X-Name-Last: Brown Title: New class of estimators of the population mean using the known population median of the study variable Abstract: In this paper, we propose an improved class of estimators of the population mean using the population median of the study variable. We study the properties of the sampling distribution of the proposed class of estimators up to the approximation of order one. Different values of the two characterising constants in the new estimators affect the mean squared error (MSE) of the proposed family of estimators. Finding the optimum values of the constants to minimise the MSE of the suggested class of estimators provides the least MSE of the recommended family for these optimal values of the characterising scalars. We compare the proposed family of estimators with other competing estimators of the population mean. The theoretical findings are justified with an empirical example and reveal that the proposed class of estimators performs more efficiently than other competing estimators of the population mean under a simple random sampling without replacement (SRSWOR) scheme. Journal: Int. J. of Mathematics in Operational Research Pages: 179-201 Issue: 2 Volume: 16 Year: 2020 Keywords: main variable; known variable; ratio estimators; bias; mean squared error; MSE; efficiency. File-URL: http://www.inderscience.com/link.php?id=105856 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:2:p:179-201 Template-Type: ReDIF-Article 1.0 Author-Name: Zahra Homayouni Author-X-Name-First: Zahra Author-X-Name-Last: Homayouni Author-Name: Mir Saman Pishvaee Author-X-Name-First: Mir Saman Author-X-Name-Last: Pishvaee Title: A robust bi-objective programming approach to environmental closed-loop supply chain network design under uncertainty Abstract: Imposition of strict environmental protection acts and the imperative need of the best possible allocation of resources have given birth to the concept of low carbon logistics. Environmental laws force the manufacturers to extend their existing supply chains to form a closed-loop supply chain (CLSC) through the setup of an efficient recovery system. In this paper, a multi-objective robust optimisation model is proposed for the design of CLSC network under uncertainty. First, a deterministic bi-objective mixed integer linear programming (BOMILP) model is developed for designing a CLSC network. Then, the robust counterpart of the proposed BOMILP is presented to cope with the real-world uncertainty. The first objective aims to maximise the total profit generated in the CLSC network and the second objective minimises the environmental pollution of the CLSC network. The proposed bi-objective model is solved using a multi-choice goal programming (MCGP) approach. Journal: Int. J. of Mathematics in Operational Research Pages: 257-278 Issue: 2 Volume: 16 Year: 2020 Keywords: closed-loop supply chain; CLSC; multi-choice goal programming; MCGP; environmental issues; robust optimisation. File-URL: http://www.inderscience.com/link.php?id=105857 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:2:p:257-278 Template-Type: ReDIF-Article 1.0 Author-Name: Atsuhiro Satoh Author-X-Name-First: Atsuhiro Author-X-Name-Last: Satoh Author-Name: Yasuhito Tanaka Author-X-Name-First: Yasuhito Author-X-Name-Last: Tanaka Title: Sion's minimax theorem and Nash equilibrium of symmetric three-players zero-sum game Abstract: About a symmetric three-players zero-sum game we will show the following results. A modified version of Sion's minimax theorem with the coincidence of the maximin strategy and the minimax strategy are proved by the existence of a symmetric Nash equilibrium. The existence of a symmetric Nash equilibrium is proved by the modified version of Sion's minimax theorem with the coincidence of the maximin strategy and the minimax strategy. Thus, they are equivalent. However, without the coincidence of the maximin strategy and the minimax strategy there may exist an asymmetric equilibrium in a symmetric three-players zero-sum game. Journal: Int. J. of Mathematics in Operational Research Pages: 279-289 Issue: 2 Volume: 16 Year: 2020 Keywords: three-players zero-sum game; Nash equilibrium; Sion's minimax theorem. File-URL: http://www.inderscience.com/link.php?id=105859 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:2:p:279-289 Template-Type: ReDIF-Article 1.0 Author-Name: Mohand Ouamer Bibi Author-X-Name-First: Mohand Ouamer Author-X-Name-Last: Bibi Author-Name: Nacira Ikheneche Author-X-Name-First: Nacira Author-X-Name-Last: Ikheneche Author-Name: Mohand Bentobache Author-X-Name-First: Mohand Author-X-Name-Last: Bentobache Title: A hybrid direction algorithm for solving a convex quadratic problem Abstract: In this paper, we propose a new algorithm for solving convex quadratic programming problems with bounded variables. Instead of using the standard direction of the adaptive method, which is constructed by minimising only the linear part of the objective function increment, we will suggest a new descent direction, called 'hybrid direction'. This latter is constructed by minimising a quadratic part of the increment. Furthermore, we define a quantity called 'optimality estimate' from which we derive sufficient and necessary conditions of optimality. On the basis of this new concept, we construct an algorithm for solving convex quadratic programs. In order to compare our method with the active-set method implemented in MATLAB, numerical experiments on randomly generated test problems are presented. Journal: Int. J. of Mathematics in Operational Research Pages: 159-178 Issue: 2 Volume: 16 Year: 2020 Keywords: convex quadratic programming; adaptive method; bounded variables; hybrid direction; optimality estimate; numerical experiments. File-URL: http://www.inderscience.com/link.php?id=105862 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:2:p:159-178 Template-Type: ReDIF-Article 1.0 Author-Name: Hossein Safari Author-X-Name-First: Hossein Author-X-Name-Last: Safari Author-Name: Abdol Hossein Jafarzadeh Author-X-Name-First: Abdol Hossein Author-X-Name-Last: Jafarzadeh Author-Name: Mohammad Reza Fathi Author-X-Name-First: Mohammad Reza Author-X-Name-Last: Fathi Title: Evaluation of the branches of Iran Insurance Corporation based on data envelopment analysis-free disposal hull in the presence of weight restrictions Abstract: This study reviews the concepts of performance evaluation in the insurance industry based on data envelopment analysis. In this study to deal with the problems that exists in conventional DEA model, a new DEA model is introduced and applied based on FDH and weight restrictions to evaluate Insurance Corporation' branches. In this study, non-parametric frontier technologies for data analysis are mainly discussed. It combines several models with non-parametric frontier technology to suggest a new model for analysing the data. This paper is based on a combination of the two frontier technology, DEA and free disposal hull. As it is mainly based on DEA and benchmarking based on DEA. The proposed method was successfully conducted in a case study about Iran Insurance Corporation; secondly, the paper depicts the insurance company evaluation process through a DEA model, while allowing for incorporating the preferences of decision maker. According to result, 26 branches are efficient and achieved efficiency score is equal to 1. Journal: Int. J. of Mathematics in Operational Research Pages: 202-216 Issue: 2 Volume: 16 Year: 2020 Keywords: insurance; performance evaluation; non-parametric analysis; data envelopment analysis; DEA; free disposal hull; FDH; benchmarking; weight restrictions; discernment power. File-URL: http://www.inderscience.com/link.php?id=105871 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:2:p:202-216 Template-Type: ReDIF-Article 1.0 Author-Name: P. Vijaya Laxmi Author-X-Name-First: P. Vijaya Author-X-Name-Last: Laxmi Author-Name: T. Wondewosen Kassahun Author-X-Name-First: T. Wondewosen Author-X-Name-Last: Kassahun Title: Transient analysis of multi-server Markovian queueing system with synchronous multiple working vacations and impatience of customers Abstract: In this paper, we study an infinite capacity multi-server Markovian queue with synchronous multiple working vacations, balking and reneging. It is assumed that customers may balk and/or renege with some probability if all the <i>c</i> servers are busy serving customers either during the regular busy period or working vacation period. The reneging times follow an exponential distribution. The system is modeled by a quasi-birth-death process and the transient-state probabilities of the model are obtained in the Laplace domain using matrix geometric method. Journal: Int. J. of Mathematics in Operational Research Pages: 217-237 Issue: 2 Volume: 16 Year: 2020 Keywords: multiple working vacations; balking; reneging; transient-state probabilities; matrix geometric method; Laplace transform. File-URL: http://www.inderscience.com/link.php?id=105880 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:2:p:217-237 Template-Type: ReDIF-Article 1.0 Author-Name: John Willmer Escobar Author-X-Name-First: John Willmer Author-X-Name-Last: Escobar Author-Name: Andres Arroyo Marin Author-X-Name-First: Andres Arroyo Author-X-Name-Last: Marin Author-Name: Juan David Lince Author-X-Name-First: Juan David Author-X-Name-Last: Lince Title: Multi-objective mathematical model for the redesign of supply chains considering financial criteria optimisation and scenarios Abstract: This paper considers the redesign problem of a supply chain for mass consumer products, considering financial criteria and scenarios of demand. An established supply chain is adopted as the starting point. The central problem lies in determining the closure and consolidation of distribution centres. The problem is solved using a multi-objective mixed-integer linear programming model, considering two objective functions: the maximisation of the net present value (NPV) of the supply chain and the minimisation of the financial risk. The efficiency of the mathematical model is tested with real data from a Colombian multinational manufacturer of mass consumer products. The results confirm the model's efficiency and the positive impact on the determination of the NPV and the financial risk of the company. Journal: Int. J. of Mathematics in Operational Research Pages: 238-256 Issue: 2 Volume: 16 Year: 2020 Keywords: supply chain optimisation; multi-objective mathematical model; net present value; NPV; financial risk; logistics; scenarios. File-URL: http://www.inderscience.com/link.php?id=105903 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:2:p:238-256 Template-Type: ReDIF-Article 1.0 Author-Name: Lanndon A. Ocampo Author-X-Name-First: Lanndon A. Author-X-Name-Last: Ocampo Author-Name: Eppie E. Clark Author-X-Name-First: Eppie E. Author-X-Name-Last: Clark Author-Name: Anthony S.F. Chiu Author-X-Name-First: Anthony S.F. Author-X-Name-Last: Chiu Author-Name: Raymond R. Tan Author-X-Name-First: Raymond R. Author-X-Name-Last: Tan Title: Holistically addressing uncertainty in group decision-making: the case of a 'quasi-collaborative' group structure Abstract: This paper presents a methodology that holistically captures the uncertainty of judgment in 'quasi-collaborative' group decision-making in the context of the analytic hierarchy/network process. The proposed method is motivated mainly by the two uncertainty approaches that seemingly diverge in literature: the simulation approach and the fuzzy set theory (FST) approach. In the proposed method, FST is used to handle the judgmental uncertainty of individual decision-maker while simulation addresses randomness and uncertainty when individual judgments are aggregated as a group decision. An illustrative problem is presented in this paper along with a numerical experiment that attempts to compare the efficacy of the proposed methodology with existing methods. Results show that the method is more capable of handling uncertain group decisions through simulation runs and it can perform sensitivity analysis which is essential in testing robustness of judgment results. Finally, the proposed method can identify non-expert member of the group. Journal: Int. J. of Mathematics in Operational Research Pages: 316-353 Issue: 3 Volume: 16 Year: 2020 Keywords: analytic hierarchy process; AHP; analytic network process; ANP; simulation; fuzzy set theory; FST; sensitivity analysis. File-URL: http://www.inderscience.com/link.php?id=106905 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:3:p:316-353 Template-Type: ReDIF-Article 1.0 Author-Name: Murshid Kamal Author-X-Name-First: Murshid Author-X-Name-Last: Kamal Author-Name: Srikant Gupta Author-X-Name-First: Srikant Author-X-Name-Last: Gupta Author-Name: Irfan Ali Author-X-Name-First: Irfan Author-X-Name-Last: Ali Title: A decentralised multi-objective sustainable supply chain model under intuitionistic fuzzy environment Abstract: This paper uses the fuzzy goal programming approach with different kinds of membership functions like linear, exponential, parabolic, hyperbolic and quadratic membership; for solving the multi-objective sustainable supply chain (MOSSC) problem under the intuitionistic fuzzy environment. The primary objective is to maximise the minimum value of the membership function so the preferred compromise solution can achieve to the MOSSC problem. By attaining this preferred compromise solution, the optimum order quantity allocation to each supplier can also be determined. Additionally, a situation even has been considered where the decision maker tries to control the optimum order quantity and search for another satisfactory solution, for this, he uses the membership function. A case study of the sustainable supply chain has been used to show the usefulness of the proposed work. Journal: Int. J. of Mathematics in Operational Research Pages: 376-406 Issue: 3 Volume: 16 Year: 2020 Keywords: multi-objective optimisation; sustainable supply chain; supplier selection problem; SSP; fuzzy goal programming; intuitionistic fuzzy number. File-URL: http://www.inderscience.com/link.php?id=106906 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:3:p:376-406 Template-Type: ReDIF-Article 1.0 Author-Name: Sourav Pradhan Author-X-Name-First: Sourav Author-X-Name-Last: Pradhan Title: On the distribution of an infinite-buffer queueing system with versatile bulk-service rule under batch-size-dependent service policy: M/Gn(a,Y) /1 Abstract: Batch-service queues have a wide range of noteworthy applications in wireless telecommunication to deal with the multimedia type of data, manufacturing systems, group testing procedure, etc. The knowledge of both the queue and server content distributions helps the system designer to evaluate the efficiency of the queueing system in a better way. We analyse a single server infinite-buffer batch-size-dependent service queue with Poisson arrival and versatile batch-service rule. Based on supplementary variable technique, a bivariate probability generating function, the entire spectrum of new contributions, of queue content and number in a served batch at departure epoch is derived. Moreover, we perceive the complete queue and server content distribution at departure as well as arbitrary epochs. The utility of analytical results is illustrated by the inclusion of some numerical examples, which also includes the investigation of multiple zeroes. Journal: Int. J. of Mathematics in Operational Research Pages: 407-434 Issue: 3 Volume: 16 Year: 2020 Keywords: batch-service; versatile-bulk-service; batch-size-dependent; multiple roots; queueing; server content. File-URL: http://www.inderscience.com/link.php?id=106908 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:3:p:407-434 Template-Type: ReDIF-Article 1.0 Author-Name: Sumit Kumar Maiti Author-X-Name-First: Sumit Kumar Author-X-Name-Last: Maiti Author-Name: Sankar Kumar Roy Author-X-Name-First: Sankar Kumar Author-X-Name-Last: Roy Title: Analysing interval and multi-choice bi-level programming for Stackelberg game using intuitionistic fuzzy programming Abstract: The aim of this paper is to provide a computational algorithm for solving interval-valued and multi-choice bi-level programming for Stackelberg game using intuitionistic fuzzy approach. It also includes the cost parameters of upper and lower-level objective functions corresponding to interval numbers and multi-choice types while the parameters of constraints are intuitionistic fuzzy numbers. The interval-valued and multi-choice types objective functions are converted into deterministic form using interval programming and a general transformation technique respectively. Again, the intuitionistic fuzzy parameters of constraints are reduced to an interval by taking expected value of intuitionistic fuzzy number. A conflicting nature between the objective functions is resolved with the help of intuitionistic fuzzy programming by considering nonlinear degree of membership and non-membership functions respectively. The resultant max-min problem is solved with LINGO 15.0 iterative scheme. The developed algorithm is illustrated by an application example and Pareto optimality test is performed as well. The conclusions and an outlook of future study are described at last. Journal: Int. J. of Mathematics in Operational Research Pages: 354-375 Issue: 3 Volume: 16 Year: 2020 Keywords: bi-level programming; interval programming; multi-choice programming; intuitionistic fuzzy programming; Pareto-optimal. File-URL: http://www.inderscience.com/link.php?id=106919 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:3:p:354-375 Template-Type: ReDIF-Article 1.0 Author-Name: G. Ayyappan Author-X-Name-First: G. Author-X-Name-Last: Ayyappan Author-Name: S. Karpagam Author-X-Name-First: S. Author-X-Name-Last: Karpagam Title: Analysis of a bulk service queue with unreliable server, multiple vacation, overloading and stand-by server Abstract: We studied the behaviour of an <i>M</i><SUP align="right"><SMALL>[<i>X</i>]</SMALL></SUP>/<i>G</i>(<i>a</i>, <i>b</i>)/1 queueing system with unreliable server, multiple vacation, overloading and stand-by server in this paper. The stand-by server is utilised only during main server's repair period. The probability generating function (PGF) of queue size and some important performance measures are derived. An extensive numerical result is illustrated. Journal: Int. J. of Mathematics in Operational Research Pages: 291-315 Issue: 3 Volume: 16 Year: 2020 Keywords: general bulk service; unreliable server; stand-by server; multiple vacation; overloading. File-URL: http://www.inderscience.com/link.php?id=106927 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:3:p:291-315 Template-Type: ReDIF-Article 1.0 Author-Name: Amir Abbas Shojaie Author-X-Name-First: Amir Abbas Author-X-Name-Last: Shojaie Author-Name: Seyed Esmail Seyedi Bariran Author-X-Name-First: Seyed Esmail Seyedi Author-X-Name-Last: Bariran Title: Comparison of two modified meta-heuristic soft algorithms for solving a bi-objective facility layout problem Abstract: Facility layout problem (FLP) is one of the most important location analysis problems in operation research and computational geometry. This paper presents a novel optimisation model-based two meta-heuristics of particle swarm optimisation (PSO) and parallel simulated annealing (SA). Then, the problem is solved using the modified algorithms to determine the total material handling cost and dead space. The results obtained from the two proposed models are then compared and analysed by referring to two well-known previous approaches to find the optimal solution for the problem. The obtained results show that the modified PSO and SA algorithms outperform the previous two methods and therefore can be effectively as an optimal solution for certain bi-objective facility layout problems. Journal: Int. J. of Mathematics in Operational Research Pages: 435-454 Issue: 3 Volume: 16 Year: 2020 Keywords: facility layout; meta-heuristic; particle swarm optimisation; PSO; facility layout problem; FLP; simulated annealing; SA. File-URL: http://www.inderscience.com/link.php?id=106928 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:3:p:435-454 Template-Type: ReDIF-Article 1.0 Author-Name: E. Mamatha Author-X-Name-First: E. Author-X-Name-Last: Mamatha Author-Name: S. Saritha Author-X-Name-First: S. Author-X-Name-Last: Saritha Author-Name: C.S. Reddy Author-X-Name-First: C.S. Author-X-Name-Last: Reddy Author-Name: P. Rajadurai Author-X-Name-First: P. Author-X-Name-Last: Rajadurai Title: Mathematical modelling and performance analysis of single server queuing system - eigenspectrum Abstract: Classical queuing theory is playing vital role to study and analyse the performance analysis of real-time servicing systems, production inventory and manufacturing systems, telecommunication systems, modern information and communication technology systems and computing sector. In recent decays, bounded and immeasurable queues have been intensively studied; due to its attractive mathematical features with wide spread applicability. Such a system describes units of work, e.g., particles or customers, arriving at a resource, that stay present for some random duration that is independent of other customers. The aim of this paper is to evaluate the performance measures with a single server queuing system. Mathematical model has been developed to study the probability live time of the server using algebraic eigenproperties. These models are indispensable in real-time systems, manufacturing and communication queuing systems, including wireless networks, mobility, and randomly arriving traffic. Journal: Int. J. of Mathematics in Operational Research Pages: 455-468 Issue: 4 Volume: 16 Year: 2020 Keywords: Markov process; server live probability; latent values and vectors; matrix geometric approach; single server queuing system. File-URL: http://www.inderscience.com/link.php?id=108408 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:4:p:455-468 Template-Type: ReDIF-Article 1.0 Author-Name: E. El-Ghamry Author-X-Name-First: E. Author-X-Name-Last: El-Ghamry Author-Name: M. El-Damsece Author-X-Name-First: M. Author-X-Name-Last: El-Damsece Author-Name: M. Shokry Author-X-Name-First: M. Author-X-Name-Last: Shokry Title: Reliability analysis of different systems using triangular multi-fuzzy sets estimated by statistical data Abstract: In this paper, the multi-fuzzy sets and its arithmetic operations are first introduced briefly then we describe an idea of using multi-fuzzy sets approach to reliability analysis of different types of unrepairable fuzzy systems as series, parallel, series-parallel and parallel-series systems consist of independent components. The knowledge about causes and effects of failures is usually described with large uncertainty content so the reliability of each component can be represented by triangular multi-fuzzy set. Each multi-fuzzy set is estimated by using the concept of confidence interval that calculated based on statistical data taken from random samples of each component. A numerical example is given to demonstrate the applicability of the multi-fuzzy sets in different structural engineering systems and the results were drawn by using MAPLE software program. Journal: Int. J. of Mathematics in Operational Research Pages: 499-514 Issue: 4 Volume: 16 Year: 2020 Keywords: reliability; multi-fuzzy set; confidence interval; statistical data. File-URL: http://www.inderscience.com/link.php?id=108418 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:4:p:499-514 Template-Type: ReDIF-Article 1.0 Author-Name: Prakash Marimuthu Author-X-Name-First: Prakash Author-X-Name-Last: Marimuthu Author-Name: P. Chinnamuthu Author-X-Name-First: P. Author-X-Name-Last: Chinnamuthu Author-Name: R. Jeyapaul Author-X-Name-First: R. Author-X-Name-Last: Jeyapaul Title: Analysis of parameter selection for solar radiation prediction and global solar radiation prediction model using polynomial regression Abstract: Solar irradiance is available in abundance and can be harvested to satisfy ever-growing energy demand. Installation of photovoltaic (PV) solar panels at any desired location is not often economically feasible and hence prediction of solar radiation is crucial. Relative humidity and temperature at a specific location Chumukedima, Nagaland (latitude 25.86 N, longitude 93.75 E) in India have been used for the present study along with the solar irradiance outcome. Significant parameter contributing towards the solar radiation outcome is derived with the help of design of experiments (DOE) and analysis of variance (ANOVA). Polynomial regression model is developed to predict the solar irradiation. From the results obtained, it is evident that the humidity contributes more towards the solar irradiation prediction. Journal: Int. J. of Mathematics in Operational Research Pages: 469-479 Issue: 4 Volume: 16 Year: 2020 Keywords: solar radiation; analysis of variance; ANOVA; design of experiment; DOE; polynomial regression. File-URL: http://www.inderscience.com/link.php?id=108419 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:4:p:469-479 Template-Type: ReDIF-Article 1.0 Author-Name: G. Ayyappan Author-X-Name-First: G. Author-X-Name-Last: Ayyappan Author-Name: J. Udayageetha Author-X-Name-First: J. Author-X-Name-Last: Udayageetha Author-Name: B. Somasundaram Author-X-Name-First: B. Author-X-Name-Last: Somasundaram Title: Analysis of non-pre-emptive priority retrial queueing system with two-way communication, Bernoulli vacation, collisions, working breakdown, immediate feedback and reneging Abstract: In this study, we investigate a single server priority retrial queueing system including two-way communication, collision, working breakdown, repair, immediate feedback, Bernoulli vacation and reneging. Incoming requests (calls) appear at the service station according to a compound Poisson process. During the idle time, the server can make an outgoing call with an exponentially distributed time. The incoming call that identifies the server occupied will join an orbit or collide with the call currently in service. The server renders the service following a non-pre-emptive priority service rule. The server takes a Bernoulli vacation. The server may become inactive due to normal breakdown and the call currently in service will get the remaining service at a moderate service rate. The repair process starts instantly. After the completion of service, vacation and repair the server is in an idle state. We allow reneging to happen at the orbit. Using the supplementary variable technique, the stability condition is derived. Journal: Int. J. of Mathematics in Operational Research Pages: 480-498 Issue: 4 Volume: 16 Year: 2020 Keywords: priority queueing systems; two-way communication; retrial queue; working breakdown; collisions; Bernoulli vacation. File-URL: http://www.inderscience.com/link.php?id=108420 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:4:p:480-498 Template-Type: ReDIF-Article 1.0 Author-Name: N. Sangeetha Author-X-Name-First: N. Author-X-Name-Last: Sangeetha Author-Name: B. Sivakumar Author-X-Name-First: B. Author-X-Name-Last: Sivakumar Title: Optimal service rates of a perishable inventory system with service facility Abstract: This paper studies a continuous-review perishable inventory system with service facility. We consider a finite capacity inventory system with Markovian arrivals and exponentially distributed service times. The inventory is replenished according to an (<i>s</i>, <i>S</i>) policy and the lead times follow phase type distribution. The life time of each item is assumed to be exponential. By controlling the service rate at each instance of time, we can minimise the total expected cost rate. We formulate this model as a semi Markov decision problem. The stationary optimal policy is computed using linear programming algorithm and the results are illustrated numerically. Journal: Int. J. of Mathematics in Operational Research Pages: 515-550 Issue: 4 Volume: 16 Year: 2020 Keywords: inventory control; Markovian arrivals; (s, S) ordering policy; control of service rates; semi Markov decision process. File-URL: http://www.inderscience.com/link.php?id=108438 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:16:y:2020:i:4:p:515-550 Template-Type: ReDIF-Article 1.0 Author-Name: Chrystopher Vaca Terán Author-X-Name-First: Chrystopher Vaca Author-X-Name-Last: Terán Author-Name: Javier Martínez-Gómez Author-X-Name-First: Javier Author-X-Name-Last: Martínez-Gómez Author-Name: Julio César Leguísamo Milla Author-X-Name-First: Julio César Leguísamo Author-X-Name-Last: Milla Title: Material selection through of multi-criteria decisions methods applied to a helical gearbox Abstract: The aim of this study was to select the best material using the multi-criteria decision methods, obtaining the best results and the respective choice of material, optimising surface fatigue and increasing its resistance to wear applied to a gearbox. For which the multi-criteria decision methods were done to obtain an order or ranking of the set of alternatives. To obtain this ranking, the set of alternatives must be well defined, just as the criteria must be well determined. After using the multi-criteria, it was determined that the material chosen according to the ranking and is the third alternative that has relevant characteristics such as elastic limit, tensile strength and good thermal capacity. The entropy method applied to the weights helps avoid the subjectivity of the designer and make it conform to real parameters. According to the methods COPRAS, TOPSIS, PROMETHEE and VIKOR; the best material is the AISI 4140, due to the best mechanical and thermal properties. On the basis of the numerical results, it can be concluded that the proposed methods can deal with the problems of material selection with the dependence of criteria. Journal: Int. J. of Mathematics in Operational Research Pages: 90-109 Issue: 1 Volume: 17 Year: 2020 Keywords: multi-criteria decisions methods; MCDM; material selection; weighting and classification factors; criteria dependence; helical gear. File-URL: http://www.inderscience.com/link.php?id=109035 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:1:p:90-109 Template-Type: ReDIF-Article 1.0 Author-Name: Aniruddha Samanta Author-X-Name-First: Aniruddha Author-X-Name-Last: Samanta Author-Name: Kajla Basu Author-X-Name-First: Kajla Author-X-Name-Last: Basu Title: A prospective multi-attribute decision making-based reliability allocation method using fuzzy linguistic approach and minimum effort function Abstract: Reliability allocation has a great importance in the early design stage of a system. The result of this allocation directly affects the product's quality and robustness of the system. There are several reliability allocation techniques to allocate the target reliability. But these methods have several shortcomings. To overcome these shortcomings, a new allocation method considering future limiters depending upon the concept of prospective multi-attribute decision making (PMADM) has been proposed here. Also the fuzzy linguistic term sets, minimal variance OWGA weights and experts degree of orness have been combined to perform a more practical reliability allocation. Ultimately to recognise the nonlinear phenomenon for reliability and the element's potential for improvement, the proposed method takes an initiative to improve the initial target reliability using reliability growth effort function. An example of transceiver system is considered here to illustrate the efficiency and flexibility of the proposed approach to allocate the system reliability. Journal: Int. J. of Mathematics in Operational Research Pages: 30-49 Issue: 1 Volume: 17 Year: 2020 Keywords: prospective multi-attribute decision making; PMADM; ordered weighted geometric averaging operator; OWGA; reliability allocation; proportionality factor; reliability growth effort function. File-URL: http://www.inderscience.com/link.php?id=109037 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:1:p:30-49 Template-Type: ReDIF-Article 1.0 Author-Name: Alaa Awad Alzulaibani Author-X-Name-First: Alaa Awad Author-X-Name-Last: Alzulaibani Title: Stability of the optimal distribution for the searching effort to find the Markovian targets by using fuzzy maximum discounted effort reward search: case of the cooperative search techniques Abstract: The aim of this paper is to study the stability of the optimal distribution for the searching effort to detect two related Markovian targets by using multiple cooperative searchers. This effort, at each fixed number of time intervals, is a random variable with a normal distribution. The optimal solution (which makes the discounted effort reward with fuzzy parameter maximum) is obtained from solving a fuzzy stochastic optimisation problem. Rather than presenting an algorithm that shows the stability of the optimal distribution of an effort, we study more interesting special cases of located spider landmines and unrestricted effort. Two illustrative examples of Markovian and randomly located spider landmines are discussed. Journal: Int. J. of Mathematics in Operational Research Pages: 1-29 Issue: 1 Volume: 17 Year: 2020 Keywords: probability theory; stability of the optimal search; fuzzy stochastic optimisation problem; Markovian targets. File-URL: http://www.inderscience.com/link.php?id=109044 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:1:p:1-29 Template-Type: ReDIF-Article 1.0 Author-Name: Utkarsh Mahadeo Khaire Author-X-Name-First: Utkarsh Mahadeo Author-X-Name-Last: Khaire Author-Name: R. Dhanalakshmi Author-X-Name-First: R. Author-X-Name-Last: Dhanalakshmi Title: Searching for multiple equivalent predictors from oral squamous cell carcinoma dataset using statistically equivalent signature algorithm Abstract: Selecting highly predictive features from the high dimensional dataset is a formidable task. The existing feature selection algorithms available today are not dealing with multiple equally predictive subsets of features. We strongly believe that there is other subsets of features as well, which can give equivalent predictive accuracy as that of state-of-the-art algorithms. Statistically equivalent signature (SES) is one such feature selection algorithm, which is centred on constraint-based learning of Bayesian networks. The proposed model selects equivalent subsets of features from oral squamous cell carcinoma (OSCC) dataset with the help of SES. To inspect the validity of SES algorithms output, we are using K-nearest neighbour (KNN), support vector machine (SVM) and neural networks (NN) on each subset of predictive features. Finally, the results of proposed technique is compared with support vector machine - recursive feature elimination (SVM-RFE). SES produces more stable accuracy as compared to SVM-RFE. Journal: Int. J. of Mathematics in Operational Research Pages: 78-89 Issue: 1 Volume: 17 Year: 2020 Keywords: high dimensional dataset; statistically equivalent signature; SES; oral squamous cell carcinoma; OSCC; microarray; K-nearest neighbour; KNN; support vector machine; SVM; neural networks. File-URL: http://www.inderscience.com/link.php?id=109052 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:1:p:78-89 Template-Type: ReDIF-Article 1.0 Author-Name: Saeid Ghobadi Author-X-Name-First: Saeid Author-X-Name-Last: Ghobadi Title: A dynamic DEA model for resource allocation Abstract: In this paper we discuss the inverse data envelopment analysis (DEA) in framework of dynamic DEA. This discussion is based on extending the non-radial enhanced Russell measure (ERM) model to framework of dynamic DEA. Also, necessary and sufficient conditions are established to characterising dynamically efficient paths using dynamic ERM-model. Simultaneous estimation of input and output levels are studied using ERM-model under inter-temporal dependence assumption. Necessary and sufficient conditions for simultaneous estimation of input and output levels are introduced based on Pareto solutions of multiple-objective linear programming problems. In addition, the performance of the proposed method is illustrated through an example in banking sector. Journal: Int. J. of Mathematics in Operational Research Pages: 50-77 Issue: 1 Volume: 17 Year: 2020 Keywords: data envelopment analysis; DEA; inverse DEA; dynamic DEA; multiple objective linear programming; MOLP; enhanced Russell measure; ERM. File-URL: http://www.inderscience.com/link.php?id=109053 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:1:p:50-77 Template-Type: ReDIF-Article 1.0 Author-Name: Ping-Shun Chen Author-X-Name-First: Ping-Shun Author-X-Name-Last: Chen Author-Name: Wen-Tso Huang Author-X-Name-First: Wen-Tso Author-X-Name-Last: Huang Author-Name: Nai-Chun Peng Author-X-Name-First: Nai-Chun Author-X-Name-Last: Peng Author-Name: Gary Yu-Hsin Chen Author-X-Name-First: Gary Yu-Hsin Author-X-Name-Last: Chen Title: Modularising school timetabling problems in different types of classes for Taiwanese elementary and junior high schools Abstract: School timetabling problems (STPs) stem from difficult decisions related to assigning teachers and class sessions to various class time slots, subject to different scheduling, event and resource constraints. This research focused on how to efficiently construct a mathematical model of the STP subject to more than 40 class combinations for Taiwanese elementary and junior high schools. Based on the investigation, this study adopted the concept of modularity to classify class constraints into five modules: fundamental constraint, regular program, special education program, gifted performing and visual arts program and talented athlete program. This research proposed the methodology to apply the modularity concept to construct a customised class combination affected by STPs. Using the numerical data shows that the corresponding school timetable could be generated based on the customised class combination of the STPs. In addition, the scenarios with an objective function or with an infeasible solution were analysed and discussed. Finally, a framework of the automated school timetabling system based on the modularity concept was presented for future school timetabling system development. Journal: Int. J. of Mathematics in Operational Research Pages: 110-152 Issue: 1 Volume: 17 Year: 2020 Keywords: educational timetabling problem; high school timetable; multiple class types; modularity; school timetabling problem; STP; integer programming. File-URL: http://www.inderscience.com/link.php?id=109055 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:1:p:110-152 Template-Type: ReDIF-Article 1.0 Author-Name: Seyfollah Mosazadeh Author-X-Name-First: Seyfollah Author-X-Name-Last: Mosazadeh Author-Name: Abdolali Neamaty Author-X-Name-First: Abdolali Author-X-Name-Last: Neamaty Author-Name: Maedeh Bagherzadeh Author-X-Name-First: Maedeh Author-X-Name-Last: Bagherzadeh Title: On the numerical solution of an inverse spectral problem with a singular potential Abstract: This paper deals with the unique solvability of the inverse problem for second-order differential operators having a singular potential. It is shown that the coefficients of the differential operator can be determined from the spectral data. Then, we construct the theoretical bases and provide a numerical algorithm for solving the inverse problem of spectral analysis and finding the potential function. Finally, some numerical examples are considered to demonstrate the applicability of the algorithm. Journal: Int. J. of Mathematics in Operational Research Pages: 186-198 Issue: 2 Volume: 17 Year: 2020 Keywords: inverse spectral problem; singular potential; spectral function; numerical solution. File-URL: http://www.inderscience.com/link.php?id=109692 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:2:p:186-198 Template-Type: ReDIF-Article 1.0 Author-Name: Mostafa Dastmardi Author-X-Name-First: Mostafa Author-X-Name-Last: Dastmardi Author-Name: Mohammad Mohammadi Author-X-Name-First: Mohammad Author-X-Name-Last: Mohammadi Author-Name: Bahman Naderi Author-X-Name-First: Bahman Author-X-Name-Last: Naderi Title: Maximal covering salesman problems with average travelling cost constrains Abstract: We study the maximal covering salesman problem with the average travelling cost constraints (MCSPATCC) where the objective is to find a subset of customers with their tour so that the number of covered demand points is maximised. This paper presents a mathematical model to select a profitable subset of demand points to be covered. We also propose an effective heuristic algorithm with three elimination methods to remove unprofitable demand points. The proposed algorithm is based on the genetic algorithm (GA) hybridised with different local search strategies to solve this problem. Parameters of the algorithm are analysed for calibration by the Taguchi method. Extensive computational experiments, on a set of standard problems, have indicated the effectiveness of our algorithm. Journal: Int. J. of Mathematics in Operational Research Pages: 153-169 Issue: 2 Volume: 17 Year: 2020 Keywords: maximum covering; genetic algorithm; covering salesman problem. File-URL: http://www.inderscience.com/link.php?id=109693 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:2:p:153-169 Template-Type: ReDIF-Article 1.0 Author-Name: Basil Olufemi Akinnuli Author-X-Name-First: Basil Olufemi Author-X-Name-Last: Akinnuli Author-Name: Peter Kayode Farayibi Author-X-Name-First: Peter Kayode Author-X-Name-Last: Farayibi Author-Name: Oluwaseun Oluwagbemiga Ojo Author-X-Name-First: Oluwaseun Oluwagbemiga Author-X-Name-Last: Ojo Title: Manufacturing procurement cost allocation as dominant factor under limited available manufacturing equipment budget Abstract: A production engineer as a decision maker has to setup a plan capable of meeting the needs of the customers and increase company's productivity and profitability knowing the challenges of limited available budget for the equipment procurement. This work identified the strategic decisions required for machinery budget allocation which are: machines, accessories, spare-parts and miscellaneous costs for procurement. Strategic decisions data collected were statistically analysed pre-use for forecasting the allotted required amount for their procurement based on the limited available budget using conventional related models and; optimised the scenario using goal programming model because of its multi-criteria nature of problem. Using a developed software package Java programming language for its implementation. The predicted costs based on the available budget of ₦400,000,000 for the current year were: ₦119,975,000.00, ₦127,968,000.00, ₦134,965,000.00 and ₦33,491,500.00 while their goal targets were: ₦119,975,000, ₦127,968,000, ₦577,655,000 and ₦1.1427 × 10<SUP align="right"><SMALL>9</SMALL></SUP> for machines, accessories, spare-parts and miscellaneous, respectively. Journal: Int. J. of Mathematics in Operational Research Pages: 278-299 Issue: 2 Volume: 17 Year: 2020 Keywords: cost allocation; manufacturing equipment; procurement; strategic decisions; optimisation; limited budget; goal programming; predicted costs; forecast; scenario. File-URL: http://www.inderscience.com/link.php?id=109695 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:2:p:278-299 Template-Type: ReDIF-Article 1.0 Author-Name: Meenakshi Sharma Author-X-Name-First: Meenakshi Author-X-Name-Last: Sharma Author-Name: Manisha Sharma Author-X-Name-First: Manisha Author-X-Name-Last: Sharma Author-Name: Sameer Sharma Author-X-Name-First: Sameer Author-X-Name-Last: Sharma Title: Desert sparrow optimisation algorithm for permutation flowshop scheduling problems Abstract: Permutation flowshop scheduling problems (PFSSP) with an objective to minimise the total elapsed time (makespan), are typically NP-hard in nature. Many heuristics and metaheuristics have been designed and developed to optimise makespan in flowshop scheduling environment. Better quality of metaheuristic approach depends on solution obtained by heuristic. In this paper, a nature inspired heuristic based on the biological characteristics of desert sparrow is proposed to optimise makespan in flowshop environment. The cooperative task allocation nature of desert sparrow is the basis to find the best initial feasible solution. Computational analysis depicts that proposed heuristic gives significantly better results than referred heuristics for the considered problem. Journal: Int. J. of Mathematics in Operational Research Pages: 253-277 Issue: 2 Volume: 17 Year: 2020 Keywords: flowshop scheduling; desert sparrow optimisation; DSO; constructive heuristic; makespan. File-URL: http://www.inderscience.com/link.php?id=109699 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:2:p:253-277 Template-Type: ReDIF-Article 1.0 Author-Name: Soukaina Sadiki Author-X-Name-First: Soukaina Author-X-Name-Last: Sadiki Author-Name: Maurizio Faccio Author-X-Name-First: Maurizio Author-X-Name-Last: Faccio Author-Name: Mohamed Ramadany Author-X-Name-First: Mohamed Author-X-Name-Last: Ramadany Author-Name: Driss Amegouz Author-X-Name-First: Driss Author-X-Name-Last: Amegouz Author-Name: Said Boutahari Author-X-Name-First: Said Author-X-Name-Last: Boutahari Title: Intelligent sensor impact on predictive maintenance program costs Abstract: In this work, we develop a simulation study based on economic optimisation to compare the economical impact of two maintenance policies, traditional failure maintenance policy with predictive maintenance policy that utilises intelligent network sensor information. The simulation study established in this work compare tow maintenance strategies: predictive maintenance and failure-based maintenance, in order to compare when it is less expensive to maintain the equipment before it breaks down using intelligent network sensors than to replace it after its breakdown, to sum up, if it is profitable to implement this new technology. Also with this proposed approach, the decision maker could be in the position to decide on a most appropriate economical framework for the optimum cost, based on the comparison between breakdown cost and the cost of sensors. The method can be used by companies to make a decision when considering implementing remote monitoring. To illustrate the use and the advantages of the proposed maintenance policy, a numerical example is investigated. Journal: Int. J. of Mathematics in Operational Research Pages: 170-185 Issue: 2 Volume: 17 Year: 2020 Keywords: predictive maintenance; failure-based maintenance; intelligent network sensors; downtime; cost optimisation; decision-making. File-URL: http://www.inderscience.com/link.php?id=109700 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:2:p:170-185 Template-Type: ReDIF-Article 1.0 Author-Name: Ephraim Clark Author-X-Name-First: Ephraim Author-X-Name-Last: Clark Author-Name: Sovan Mitra Author-X-Name-First: Sovan Author-X-Name-Last: Mitra Author-Name: Octave Jokung Author-X-Name-First: Octave Author-X-Name-Last: Jokung Title: Keynesian resurgence: financial stimulus and contingent claims modelling Abstract: Since the commencement of the Global Financial Crisis, a worldwide resurgence in applying Keynesian modelling has occurred, and has been cited as a major factor in averting a worldwide economic depression. A key aspect of Keynesian modelling is that governments gain contingent claims on firms in exchange for financial stimulus. However, there exist few mathematical finance models examining Keynesian modelling, stimulus modelling and the valuation of such government contingent claims. In this paper we provide a new mathematical finance framework for modelling firms and financial stimulus under a Keynesian framework; we apply a stochastic differential equation model, rather than the standard time series models. Our model incorporates fundamental concepts of Keynesian modelling and Keynesian stimulus, which is a new characteristic to current financial models. We model the government's contingent claim on the firm as a real call option, and derive a closed form solution for the value of this option which takes into account firm stimulus. We also derive a solution for the minimum firm value required to exercise the option. We conduct numerical experiments for different firm equilibrium values, firm values, economic cycles and analyse the impact on option and stimulus values. Journal: Int. J. of Mathematics in Operational Research Pages: 199-232 Issue: 2 Volume: 17 Year: 2020 Keywords: financial crisis; stimulus spending; real options; Keynesian economics; geometric Ornstein-Uhlenbeck. File-URL: http://www.inderscience.com/link.php?id=109701 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:2:p:199-232 Template-Type: ReDIF-Article 1.0 Author-Name: Sani Dari Author-X-Name-First: Sani Author-X-Name-Last: Dari Author-Name: Babangida Sani Author-X-Name-First: Babangida Author-X-Name-Last: Sani Title: An EPQ model for delayed deteriorating items with reliability consideration and quadratic demand Abstract: In this paper, an EPQ model for delayed deteriorating items is developed where the demand before deterioration sets in is assumed to be different from that after deterioration sets in. There are three stages for the inventory system as follows: 1) the production build-up stage (0 &le; <i>t</i> &le; <i>L</i><SUB align="right"><SMALL>1</SMALL></SUB>); 2) stage before deterioration sets in (<i>L</i><SUB align="right"><SMALL>1</SMALL></SUB> &le; <i>t</i> &le; <i>L</i><SUB align="right"><SMALL>2</SMALL></SUB>); 3) stage after deterioration sets in (<i>L</i><SUB align="right"><SMALL>3</SMALL></SUB> &le; <i>t</i> &le; <i>L</i>). It is also assumed that the unit cost of production is directly proportional to the process reliability and inversely proportional to the rate of demand and shortages are not allowed. A numerical example is given to illustrate the developed model and sensitivity analysis carried out on the example to see the effect of parameter changes. Journal: Int. J. of Mathematics in Operational Research Pages: 233-252 Issue: 2 Volume: 17 Year: 2020 Keywords: economic production quantity; EPQ; quadratic demand; reliability; delayed deterioration. File-URL: http://www.inderscience.com/link.php?id=109704 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:2:p:233-252 Template-Type: ReDIF-Article 1.0 Author-Name: Tolulope Latunde Author-X-Name-First: Tolulope Author-X-Name-Last: Latunde Title: Multifactor modelling in asset management Abstract: A multifactor model of capital asset management is formulated from the perspective of investors, under the assumptions of hyperbolic absolute risk aversion, and employing the basic skills of mathematical modelling. The solution to a special case of problems in asset management is sought by formulating a continuous-time utility portfolio model satisfying some uncertainty criteria where investment is continuous, investors do not possess enough power to determine price and investors can borrow money for a given period of time at a particular interest rate. Thereafter, the model is solved analytical and the optimal values of control variables are derived using optimality conditions. Journal: Int. J. of Mathematics in Operational Research Pages: 333-352 Issue: 3 Volume: 17 Year: 2020 Keywords: multifactor; modelling; optimal control; optimality; uncertainty theory; capital asset management. File-URL: http://www.inderscience.com/link.php?id=110023 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:3:p:333-352 Template-Type: ReDIF-Article 1.0 Author-Name: A.A. Khajehnasiri Author-X-Name-First: A.A. Author-X-Name-Last: Khajehnasiri Author-Name: M. Afshar Kermani Author-X-Name-First: M. Afshar Author-X-Name-Last: Kermani Author-Name: R. Ezzati Author-X-Name-First: R. Author-X-Name-Last: Ezzati Title: Chaos in a fractional-order financial system Abstract: In this paper, a fractional order financial system is proposed, and the complex dynamical behaviours of such a system are discussed by numerical simulations. We present a method for solving chaos in fractional-order financial system. Also, we derive the Hat function operational matrix of the fractional order integration and use it to solve the fractional-order financial system. To demonstrate the validity of the presented developments, three numerical simulations are given to verify the effectiveness of the proposed method. Journal: Int. J. of Mathematics in Operational Research Pages: 318-332 Issue: 3 Volume: 17 Year: 2020 Keywords: chaos; Hat functions; fractional calculus; block pulse function; BPF; operational matrix; state space. File-URL: http://www.inderscience.com/link.php?id=110028 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:3:p:318-332 Template-Type: ReDIF-Article 1.0 Author-Name: T. Deepa Author-X-Name-First: T. Author-X-Name-Last: Deepa Author-Name: A. Azhagappan Author-X-Name-First: A. Author-X-Name-Last: Azhagappan Title: Transient behaviour of an M/Ek/1 queue with vacations, balking and control of admission during vacations Abstract: This paper studies the transient behaviour of an <i>M</i>/<i>E<SUB align="right"><SMALL>k</SMALL></SUB></i>/1 queueing model with single and multiple vacations, balking and control of admission during vacations. An arriving customer undergoes <i>k</i> exponential phases of service before leaving the system. Whenever the system becomes empty, the server starts vacation (single or multiple). All the arriving customers are not allowed to join the queue during vacations. That is, they are either permitted to join the queue or rejected. During the vacation period, the permitted arrivals may either join the queue or balk. Using the method of generating function, the transient system size probabilities are derived for the proposed model in terms of generalised modified Bessel function of the second kind. The system performance measures such as average and variance of system size, probability of system empty and server idle are also obtained. Numerical illustrations are presented to analyse the influence of the system parameters. Journal: Int. J. of Mathematics in Operational Research Pages: 371-390 Issue: 3 Volume: 17 Year: 2020 Keywords: the M/Ek/1 queue; single and multiple vacations; balking; admission control; generalised modified Bessel function; time-dependent probabilities. File-URL: http://www.inderscience.com/link.php?id=110029 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:3:p:371-390 Template-Type: ReDIF-Article 1.0 Author-Name: Ra'ft Abdelrahim Author-X-Name-First: Ra'ft Author-X-Name-Last: Abdelrahim Title: Order six generalised hybrid block method for the solution of third order initial value problems Abstract: In this article, a generalise two step method with two off step points that gives better approximate solution for third order IVP of ODEs is examined. Method of collocation and interpolation is used where approximated power series is considered as basis function. The stability properties of the method is established and the method is applied to variety of test problems. The results generated proved the superiority of the new method over existing methods in terms of error. Journal: Int. J. of Mathematics in Operational Research Pages: 353-370 Issue: 3 Volume: 17 Year: 2020 Keywords: hybrid method; block method; third order; initial value problem; power series; two off step points; collocation; interpolation. File-URL: http://www.inderscience.com/link.php?id=110030 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:3:p:353-370 Template-Type: ReDIF-Article 1.0 Author-Name: Zohreh Molamohamadi Author-X-Name-First: Zohreh Author-X-Name-Last: Molamohamadi Author-Name: Napsiah Ismail Author-X-Name-First: Napsiah Author-X-Name-Last: Ismail Author-Name: Zulkiffle Leman Author-X-Name-First: Zulkiffle Author-X-Name-Last: Leman Author-Name: Norzima Zulkifli Author-X-Name-First: Norzima Author-X-Name-Last: Zulkifli Author-Name: Anvarjon Ahmedov Author-X-Name-First: Anvarjon Author-X-Name-Last: Ahmedov Title: The supplier-retailer optimal replenishment decisions under a two-level trade credit model with shortage for deteriorating items Abstract: This paper establishes an integrated inventory model of a supplier and a manufacturer under a two-level trade credit contract. The manufacturer's inventory model follows the economic production quantity model and the produced items follow exponentially deterioration rate and price-dependent demand. Shortages are allowed for the manufacturer and are completely backlogged to the next period. Traditional inventory system and one-level trade credit are also concluded as special cases of the developed two-level trade credit model and the supply chain performance under these three policies are compared. The formulated models aim at helping the supply chain decision makers to determine the best delay strategy and find the optimal values for replenishment policy and the manufacturer's selling price in order to maximise the supply chain total net profit. The results have been then validated with a numerical example and the effect of various parameters on the optimal solution is finally studied by performing sensitivity analysis. Journal: Int. J. of Mathematics in Operational Research Pages: 391-423 Issue: 3 Volume: 17 Year: 2020 Keywords: inventory management; trade credit; permissible delay in payment; deterioration; backorder. File-URL: http://www.inderscience.com/link.php?id=110031 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:3:p:391-423 Template-Type: ReDIF-Article 1.0 Author-Name: K. Sikdar Author-X-Name-First: K. Author-X-Name-Last: Sikdar Title: Modelling and analysis of a discrete-time GIX/Geom/1/K queue with N threshold policy Abstract: This paper presents modelling and analysis of a discrete-time <i>GI<SUP align="right"><SMALL>X</SMALL></SUP></i>/<i>Geom</i>/1/<i>K</i> queueing system (where <i>K</i> is the capacity of the system) with <i>N</i> threshold policy for the early arrival system (<i>EAS</i>). The server is turned off when the system is vacant and checks the queue length every time for an arrival of a batch. As soon as the queue length reaches a pre-specified value <i>N</i>(1 &le; <i>N</i> &le; <i>K</i>), the server turns on and serves continuously until the system becomes vacant. We obtain the steady state system length distributions at pre-arrival, arbitrary and outside observer's epochs using the combination of the supplementary and the imbedded markov chain techniques. Various performance characteristics like average number of users in the queue/system, blocking probabilities of users (first-, an arbitrary- and last-user of an arriving batch) and average waiting time are obtained analytically with numerical analysis. The numerical analysis data are presented in graphical format for blocking probabilities under different buffer size values. Journal: Int. J. of Mathematics in Operational Research Pages: 301-317 Issue: 3 Volume: 17 Year: 2020 Keywords: batch arrival; discrete-time queue; finite-buffer; threshold policy. File-URL: http://www.inderscience.com/link.php?id=110032 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:3:p:301-317 Template-Type: ReDIF-Article 1.0 Author-Name: Balasubramanian Sundar Rajan Author-X-Name-First: Balasubramanian Sundar Author-X-Name-Last: Rajan Author-Name: V. Ganesan Author-X-Name-First: V. Author-X-Name-Last: Ganesan Author-Name: Samikannu Rita Author-X-Name-First: Samikannu Author-X-Name-Last: Rita Title: Batch arrival Poisson queue with breakdown and repairs Abstract: This paper considers a single server bulk arrival queuing system in which the services performed in two different stages. The server must provide the two services simultaneously. The server may opt for vacation at the end of each second stage service of the unit. The system is subjected to repair due to random breakdown and the system demands two types of repairs. When the service of any unit interrupted due to breakdown, it goes back to the head of the queue. The processes used in this system are distributed according to some designed statistical distributions. The expected number of units in the system has been obtained. Journal: Int. J. of Mathematics in Operational Research Pages: 424-435 Issue: 3 Volume: 17 Year: 2020 Keywords: bulk arrival; breakdown; vacation; repairs; mean queue size. File-URL: http://www.inderscience.com/link.php?id=110033 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:3:p:424-435 Template-Type: ReDIF-Article 1.0 Author-Name: Jalel Euchi Author-X-Name-First: Jalel Author-X-Name-Last: Euchi Title: Hybrid adaptive memory programming to optimise the multi-commodity many to many vehicle routing problem Abstract: With the quick development of urban transport networks, the multi-commodity many to many variants of pickup and delivery vehicle routing problem (PDVRP) becomes more and more important. A critical issue is to solve this variant through optimisation techniques. We address a new variant of the multi-commodity many to many PDVRP (m-MMPDVRP). The m-MMPDVRP problem is when one or multi-commodities are collected from many sites to be transported to many destinations. In this problem, we assumed that all commodities share the same vehicle capacity during transportation. All vehicles are non-homogeneous and each commodity has to be stored separately during transportation. A new model is developed, based on multiple commodities. The objective is to generate an optimal path plan, ensuring that the demand for heterogeneous commodities can be satisfied by an arbitrary set of suppliers. We propose an adaptive memory-programming (AMP) technique based on the Scatter Search (SS). The solution quality of the suggested methodology is assessed and compared with the result presented in the previous works for the same instances. Numerical experimentation shows the distinction of the AMP with Scatter Search compared with other existing techniques; and establishing an efficient metaheuristic method for the m-MMPDVRP problem. Journal: Int. J. of Mathematics in Operational Research Pages: 492-513 Issue: 4 Volume: 17 Year: 2020 Keywords: adaptive memory; many to many; pickup and delivery; routing; Scatter Search. File-URL: http://www.inderscience.com/link.php?id=110840 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:4:p:492-513 Template-Type: ReDIF-Article 1.0 Author-Name: Akram Soltanpour Author-X-Name-First: Akram Author-X-Name-Last: Soltanpour Author-Name: Fahimeh Baroughi Author-X-Name-First: Fahimeh Author-X-Name-Last: Baroughi Author-Name: Behrooz Alizadeh Author-X-Name-First: Behrooz Author-X-Name-Last: Alizadeh Title: Solving generalised intuitionistic fuzzy 1-median problem on tree networks with a new ranking method Abstract: The 1-median location problem on a tree <i>T</i> is to find a vertex <i>υ</i>* on <i>T</i> that minimise the sum of the weighted distances from all vertices to the vertex <i>υ</i>*. In this paper, we investigate the 1-median location problem on tree networks with generalised intuitionistic fuzzy weights. We first present a new method for comparing generalised fuzzy numbers and then develop it for generalised intuitionistic fuzzy numbers. The proposed method for ranking generalised fuzzy numbers can also effectively rank real numbers. These methods are able to rank the generalised trapezoidal fuzzy numbers and generalised trapezoidal intuitionistic fuzzy numbers in linear times. Then numerical examples are given to compare the proposed methods with other existing methods. Finally, we apply our ranking method to solve the 1-median location problem on a tree network with generalised trapezoidal intuitionistic fuzzy vertex weights and then we show that the problem is solvable in linear time. Journal: Int. J. of Mathematics in Operational Research Pages: 552-571 Issue: 4 Volume: 17 Year: 2020 Keywords: ranking function; generalised fuzzy numbers; G-FNs; generalised intuitionistic fuzzy numbers; G-IFNs; location problem; 1-median. File-URL: http://www.inderscience.com/link.php?id=110842 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:4:p:552-571 Template-Type: ReDIF-Article 1.0 Author-Name: Shweta Upadhyaya Author-X-Name-First: Shweta Author-X-Name-Last: Upadhyaya Author-Name: Chetna Kushwaha Author-X-Name-First: Chetna Author-X-Name-Last: Kushwaha Title: Performance prediction and ANFIS computing for unreliable retrial queue with delayed repair under modified vacation policy Abstract: This paper deals with the analysis of M<SUP align="right"><SMALL>X</SMALL></SUP>/G/1 retrial queue with impatient customers, modified vacation policy and Bernoulli feedback. When the incoming customer finds the server busy, on vacation or in the state of breakdown, he joins the virtual queue called <i>retrial orbit</i>, otherwise the service is provided to the customer who is at the head of the queue. The service is provided in <i>l</i>(0 &le; <i>i</i> &le; <i>l</i>) phases where first is compulsory service and remaining services are optional. When the system becomes empty, server leaves for the vacation of arbitrary length and can take at most <i>J</i> number of vacations. When server comes back from the vacation and finds at least one customer in the queue, he starts providing service to the customer. Supplementary variable technique (SVT) and probability generating function (PGF) method is used to derive the system size distribution and other performance indices. We have also approximated the analytical results using adaptive neuro-fuzzy interface system (ANFIS) soft computing technique, which can identify parameters using supervised learning methods. Journal: Int. J. of Mathematics in Operational Research Pages: 437-466 Issue: 4 Volume: 17 Year: 2020 Keywords: MX/G/1 retrial queue; Bernoulli feedback; multi-optional services; server breakdown; delayed repair; modified vacation policy; system size; ANFIS. File-URL: http://www.inderscience.com/link.php?id=110843 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:4:p:437-466 Template-Type: ReDIF-Article 1.0 Author-Name: Nassima Bernine Author-X-Name-First: Nassima Author-X-Name-Last: Bernine Author-Name: Hassina Nacer Author-X-Name-First: Hassina Author-X-Name-Last: Nacer Author-Name: Djamil Aissani Author-X-Name-First: Djamil Author-X-Name-Last: Aissani Author-Name: Hassane Alla Author-X-Name-First: Hassane Author-X-Name-Last: Alla Title: Towards a performance analysis of composite web services using Petri nets Abstract: The proliferation of web services-based applications, collaboration, interoperability between companies, and more generally demands of web services over the internet are major challenges in the design of performance evaluation in web services discovery and composition. It is required for the web services providers to analyse the performance related to the satisfaction of clients requests. This paper presents an analytical model based on Petri nets, for evaluating the performance of a web services system where requests and web services follow an exponential server. The arrival process of the users requests and web services follows a Poisson distribution. When the web services finish the service, they join the queue. This model follows a Poisson distribution, it is based on Petri nets. We use an analytical method for solving the model. Furthermore, we compute the system's response time, and the average number of clients in the system in terms of the arrival rate of clients requests. We find the limit number of clients in the system from which it begins to be saturated. Journal: Int. J. of Mathematics in Operational Research Pages: 467-491 Issue: 4 Volume: 17 Year: 2020 Keywords: performances analysis; requests satisfaction; composite web services; Petri nets model; analytical model; Poisson distribution. File-URL: http://www.inderscience.com/link.php?id=110847 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:4:p:467-491 Template-Type: ReDIF-Article 1.0 Author-Name: Ali Akbar Shaikh Author-X-Name-First: Ali Akbar Author-X-Name-Last: Shaikh Author-Name: Gobinda Chandra Panda Author-X-Name-First: Gobinda Chandra Author-X-Name-Last: Panda Author-Name: Md. Al-Amin Khan Author-X-Name-First: Md. Al-Amin Author-X-Name-Last: Khan Author-Name: Abu Hashan Md. Mashud Author-X-Name-First: Abu Hashan Md. Author-X-Name-Last: Mashud Author-Name: Amiya Biswas Author-X-Name-First: Amiya Author-X-Name-Last: Biswas Title: An inventory model for deteriorating items with preservation facility of ramp type demand and trade credit Abstract: In this paper, we have described an inventory model for a deteriorating item having preservation facility with trade credit policy. The demand for this inventory model is ramp type. Shortages are allowed due to the waiting time for the arrival of next lot. In this paper, we have described two inventory models due to ramp type demand. We have solved these two inventory models by using a separate numerical example. We have supplied concavity of the objective function for each model (winner case). Finally, we performed sensitivity analysis for each model and made a conclusion accordingly. Journal: Int. J. of Mathematics in Operational Research Pages: 514-551 Issue: 4 Volume: 17 Year: 2020 Keywords: EOQ model; deterioration; preservation; ramp type demand; trade credit; partial backlogging. File-URL: http://www.inderscience.com/link.php?id=110895 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijmore:v:17:y:2020:i:4:p:514-551