<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns="http://purl.org/rss/1.0/">
<channel rdf:about="http://www.inderscience.com/current_issue_rss/index.php?journal=ijmor">
<title>Most recent issue published online for the International Journal of Mathematics in Operational Research.</title>
<description>International Journal of Mathematics in Operational Research</description>
<link>http://www.inderscience.com/browse/index.php?journalID=320&amp;year=2012&amp;vol=4&amp;issue=1</link>
<dc:publisher>Inderscience Publishers Ltd</dc:publisher>
<dc:language>en-uk</dc:language>
<prism:publicationName>International Journal of Mathematics in Operational Research</prism:publicationName>
<prism:issn>1757-5850</prism:issn>
<prism:eIssn>1757-5869</prism:eIssn>
<prism:copyright>&#169; 2012 Inderscience Publishers Ltd</prism:copyright>
<prism:rightsAgent>editor@inderscience.com</prism:rightsAgent>
<image rdf:resource="https://www.inderscience.com/images/files/coverImgs/ijmor_scoverijmor.jpg" />
<items>
<rdf:Seq>
<rdf:li rdf:resource="http://dx.doi.org/10.1504/IJMOR.2012.044469" />
<rdf:li rdf:resource="http://dx.doi.org/10.1504/IJMOR.2012.044470" />
<rdf:li rdf:resource="http://dx.doi.org/10.1504/IJMOR.2012.044471" />
<rdf:li rdf:resource="http://dx.doi.org/10.1504/IJMOR.2012.044472" />
<rdf:li rdf:resource="http://dx.doi.org/10.1504/IJMOR.2012.044473" />
<rdf:li rdf:resource="http://dx.doi.org/10.1504/IJMOR.2012.044474" />
</rdf:Seq>
</items>
</channel>
<image rdf:about="https://www.inderscience.com/images/files/coverImgs/ijmor_scoverijmor.jpg">
<title>International Journal of Mathematics in Operational Research</title>
<url>https://www.inderscience.com/images/files/coverImgs/ijmor_scoverijmor.jpg</url>
<link>http://www.inderscience.com/browse/index.php?journalID=320&amp;year=2012&amp;vol=4&amp;issue=1</link>
</image>
<item rdf:about="http://dx.doi.org/10.1504/IJMOR.2012.044469">
<title>Working time evaluation in assembly lines</title>
<link>http://www.inderscience.com/link.php?id=44469</link>
<description>Assembly lines are special flow&#45;line production systems which are of great importance in the industrial mass production. This paper introduces the deterioration effects in assembly lines that the aim of the developed mathematical model and the proposed genetic algorithm is to minimise the working time of a product in a cycle of assembly. Task deterioration means that a task processed later consumes more time than the same task when it is processed earlier. At the end several well&#45;known examples are solved and the results proved that the deterioration will affect both cycle time and working time, simultaneously.</description>
<content:encoded><![CDATA[<p><a href="http://www.inderscience.com/link.php?id=44469"><b>Working time evaluation in assembly lines</b></A><br />M. Karimi&#45;Nasab; Unes Bahalke; H.R. Feili; A. Sheikhzadeh; K. Dolatkhahi<br /><i>International Journal of Mathematics in Operational Research, Vol. 4, No. 1 (2012) pp. 1 - 17</i><br />Assembly lines are special flow&#45;line production systems which are of great importance in the industrial mass production. This paper introduces the deterioration effects in assembly lines that the aim of the developed mathematical model and the proposed genetic algorithm is to minimise the working time of a product in a cycle of assembly. Task deterioration means that a task processed later consumes more time than the same task when it is processed earlier. At the end several well&#45;known examples are solved and the results proved that the deterioration will affect both cycle time and working time, simultaneously.</p>]]></content:encoded>
<dc:identifier>10.1504/IJMOR.2012.044469</dc:identifier>
<dc:source>International Journal of Mathematics in Operational Research, Vol. 4, No. 1 (2012) pp. 1 - 17</dc:source>
<dc:creator>M. Karimi&#45;Nasab; Unes Bahalke; H.R. Feili; A. Sheikhzadeh; K. Dolatkhahi</dc:creator>
<dc:contributor>Department of Industrial Engineering, Iran University of Science and Technology, P.O. Box 1684613114, Narmak, Tehran, Iran. &#39; Department of Industrial Engineering, Iran University of Science and Technology, P.O. Box 1684613114, Narmak, Tehran, Iran. &#39; Faculty of Engineering, Department of Industrial Engineering, Alzahra University, P.O. Box 1993891176, Tehran, Iran. &#39; Department of Industrial Engineering, Amirkabir University of Technology, P.O. Box 1684613114, Tehran, Iran, Iran. &#39; Department of Industrial Engineering, Iran University of Science and Technology, P.O. Box 1684613114, Narmak, Tehran, Iran</dc:contributor>
<dc:subject>assembly line balancing</dc:subject>
<dc:subject>working time</dc:subject>
<dc:subject>sequencing</dc:subject>
<dc:subject>task deterioration</dc:subject>
<dc:subject>genetic algorithms</dc:subject>
<dc:subject>GAs</dc:subject>
<dc:subject>cycle time.</dc:subject>
<dc:date>2011-12-26T23:20:50-05:00</dc:date>
<prism:volume>4</prism:volume>
<prism:number>1</prism:number>
<prism:startingPage>1</prism:startingPage>
<prism:endingPage>17</prism:endingPage>
<prism:publicationDate>2011-12-26T23:20:50-05:00</prism:publicationDate>
</item>
<item rdf:about="http://dx.doi.org/10.1504/IJMOR.2012.044470">
<title>Testing&#45;effort&#45;dependent software reliability growth model for a distributed environment using debugging time lag functions</title>
<link>http://www.inderscience.com/link.php?id=44470</link>
<description>Distributed software system consists of reused and newly developed software components. This paper presents testing&#45;effort&#45;dependent Software Reliability Growth Model &#40;SRGM&#41; for distributed environment. We have used logistic learning function for newly developed components with the assumption that the skill of the testing team grows as testing progresses. We assume that detected faults are not immediately removed but lag the fault detection process by debugging time lag. Thus, different debugging time lag functions have been used during removal process for newly developed components. The proposed model has been validated and is shown that the proposed model results are comparatively better than the existing ones.</description>
<content:encoded><![CDATA[<p><a href="http://www.inderscience.com/link.php?id=44470"><b>Testing&#45;effort&#45;dependent software reliability growth model for a distributed environment using debugging time lag functions</b></A><br />P.K. Kapur; Prashant Johri; Sunil Kumar Khatri<br /><i>International Journal of Mathematics in Operational Research, Vol. 4, No. 1 (2012) pp. 18 - 30</i><br />Distributed software system consists of reused and newly developed software components. This paper presents testing&#45;effort&#45;dependent Software Reliability Growth Model &#40;SRGM&#41; for distributed environment. We have used logistic learning function for newly developed components with the assumption that the skill of the testing team grows as testing progresses. We assume that detected faults are not immediately removed but lag the fault detection process by debugging time lag. Thus, different debugging time lag functions have been used during removal process for newly developed components. The proposed model has been validated and is shown that the proposed model results are comparatively better than the existing ones.</p>]]></content:encoded>
<dc:identifier>10.1504/IJMOR.2012.044470</dc:identifier>
<dc:source>International Journal of Mathematics in Operational Research, Vol. 4, No. 1 (2012) pp. 18 - 30</dc:source>
<dc:creator>P.K. Kapur; Prashant Johri; Sunil Kumar Khatri</dc:creator>
<dc:contributor>Amity International Business School, Amity University, Noida 201303, India. &#39; Department of Computer Science, Galgotias University, Greater Noida 201306, India. &#39; Amity Institute of Information Technology, Amity University, Noida 201303, India</dc:contributor>
<dc:subject>NHPP</dc:subject>
<dc:subject>nonhomogeneous Poisson process</dc:subject>
<dc:subject>distributed development environment</dc:subject>
<dc:subject>testing effort</dc:subject>
<dc:subject>debugging time lag functions</dc:subject>
<dc:subject>software reliability</dc:subject>
<dc:subject>distributed software</dc:subject>
<dc:subject>fault detection</dc:subject>
<dc:subject>software development.</dc:subject>
<dc:date>2011-12-26T23:20:50-05:00</dc:date>
<prism:volume>4</prism:volume>
<prism:number>1</prism:number>
<prism:startingPage>18</prism:startingPage>
<prism:endingPage>30</prism:endingPage>
<prism:publicationDate>2011-12-26T23:20:50-05:00</prism:publicationDate>
</item>
<item rdf:about="http://dx.doi.org/10.1504/IJMOR.2012.044471">
<title>Growth Optimal Portfolio for unobservable Markov&#45;modulated markets</title>
<link>http://www.inderscience.com/link.php?id=44471</link>
<description>The paper studies the benchmark approach for pricing and hedging in incomplete markets where the investor has to filter the incomplete information. We consider a jump diffusion Markov modulated market model and derive the Growth Optimal Portfolio &#40;GOP&#41;, by using the stochastic control method. Using GOP, we price and hedge European options where the existence of the equivalent martingale measure is not necessary.</description>
<content:encoded><![CDATA[<p><a href="http://www.inderscience.com/link.php?id=44471"><b>Growth Optimal Portfolio for unobservable Markov&#45;modulated markets</b></A><br />I. Venkat Appal Raju; N. Selvaraju<br /><i>International Journal of Mathematics in Operational Research, Vol. 4, No. 1 (2012) pp. 31 - 40</i><br />The paper studies the benchmark approach for pricing and hedging in incomplete markets where the investor has to filter the incomplete information. We consider a jump diffusion Markov modulated market model and derive the Growth Optimal Portfolio &#40;GOP&#41;, by using the stochastic control method. Using GOP, we price and hedge European options where the existence of the equivalent martingale measure is not necessary.</p>]]></content:encoded>
<dc:identifier>10.1504/IJMOR.2012.044471</dc:identifier>
<dc:source>International Journal of Mathematics in Operational Research, Vol. 4, No. 1 (2012) pp. 31 - 40</dc:source>
<dc:creator>I. Venkat Appal Raju; N. Selvaraju</dc:creator>
<dc:contributor>Department of Mathematics, Indian Institute of Technology Guwahati, Guwahati 781 039, India. &#39; Department of Mathematics, Indian Institute of Technology Guwahati, Guwahati 781 039, India</dc:contributor>
<dc:subject>&#63;nancial markets</dc:subject>
<dc:subject>jump diffusions</dc:subject>
<dc:subject>contingent claims</dc:subject>
<dc:subject>pricing</dc:subject>
<dc:subject>hedging</dc:subject>
<dc:subject>GOP</dc:subject>
<dc:subject>growth optimal portfolio</dc:subject>
<dc:subject>stochastic control</dc:subject>
<dc:subject>incomplete information</dc:subject>
<dc:subject>Markov modulated markets.</dc:subject>
<dc:date>2011-12-26T23:20:50-05:00</dc:date>
<prism:volume>4</prism:volume>
<prism:number>1</prism:number>
<prism:startingPage>31</prism:startingPage>
<prism:endingPage>40</prism:endingPage>
<prism:publicationDate>2011-12-26T23:20:50-05:00</prism:publicationDate>
</item>
<item rdf:about="http://dx.doi.org/10.1504/IJMOR.2012.044472">
<title>Availability of a system with different repair options</title>
<link>http://www.inderscience.com/link.php?id=44472</link>
<description>Excessive systems&#39; usage leads to failure and hence necessitates repair or replacement. Many types of repair actions could be implemented after failure. In this work, the performance of a system that is upon failure could undergo one of several repairs; imperfect repair, minimal repair, or replacement &#40;perfect repair&#41;, is examined. An analytical expression for the availability of the general system and three special cases are derived along with the long run probabilities of the different states of the system. An example is presented to illustrate and compare the performance of the three cases.</description>
<content:encoded><![CDATA[<p><a href="http://www.inderscience.com/link.php?id=44472"><b>Availability of a system with different repair options</b></A><br />Mohammed A. Hajeeh<br /><i>International Journal of Mathematics in Operational Research, Vol. 4, No. 1 (2012) pp. 41 - 55</i><br />Excessive systems&#39; usage leads to failure and hence necessitates repair or replacement. Many types of repair actions could be implemented after failure. In this work, the performance of a system that is upon failure could undergo one of several repairs; imperfect repair, minimal repair, or replacement &#40;perfect repair&#41;, is examined. An analytical expression for the availability of the general system and three special cases are derived along with the long run probabilities of the different states of the system. An example is presented to illustrate and compare the performance of the three cases.</p>]]></content:encoded>
<dc:identifier>10.1504/IJMOR.2012.044472</dc:identifier>
<dc:source>International Journal of Mathematics in Operational Research, Vol. 4, No. 1 (2012) pp. 41 - 55</dc:source>
<dc:creator>Mohammed A. Hajeeh</dc:creator>
<dc:contributor>Techno&#45;Economics Division, Kuwait Institute for Scientific Research, P.O. Box 24885, Safat&#45;13109, Kuwait</dc:contributor>
<dc:subject>imperfect repair</dc:subject>
<dc:subject>minimal repair</dc:subject>
<dc:subject>replacement</dc:subject>
<dc:subject>system failure</dc:subject>
<dc:subject>analytical expression</dc:subject>
<dc:subject>repair options</dc:subject>
<dc:subject>system availability.</dc:subject>
<dc:date>2011-12-26T23:20:50-05:00</dc:date>
<prism:volume>4</prism:volume>
<prism:number>1</prism:number>
<prism:startingPage>41</prism:startingPage>
<prism:endingPage>55</prism:endingPage>
<prism:publicationDate>2011-12-26T23:20:50-05:00</prism:publicationDate>
</item>
<item rdf:about="http://dx.doi.org/10.1504/IJMOR.2012.044473">
<title>Maximum Entropy Approach for discrete&#45;time unreliable server GeoX&#47;Geo&#47;1 queue with working vacation</title>
<link>http://www.inderscience.com/link.php?id=44473</link>
<description>This paper analyses a discrete&#45;time Geo&amp;lt;SUP align&#61;&#34;right&#34;&amp;gt;X&amp;lt;&#47;SUP&amp;gt;&#47;Geo&#47;1 queue with unreliable server and working vacation. During the vacation period, the server renders service to the primary job at lower rate rather than completely stopping service; this type of vacation is considered as working vacation. For modelling the queueing problem, the inter&#45;arrival time, service time and repair time are treated as discrete random variables. The customers are assumed to arrive at the system in batches according to a geometric process during the consecutive slots. Using the probability generating function method, we obtain the steady&#45;state distribution of the number of the customers in the system. Furthermore, Maximum Entropy Approach &#40;MEA&#41; is employed to obtain the approximate formulae for the probability distributions of the number of customers and the expected waiting time in the system in terms of several well&#45;known results. Finally, the sensitivity analysis is also carried out to illustrate the effect of different parameters on several performance characteristics.</description>
<content:encoded><![CDATA[<p><a href="http://www.inderscience.com/link.php?id=44473"><b>Maximum Entropy Approach for discrete&#45;time unreliable server GeoX&#47;Geo&#47;1 queue with working vacation</b></A><br />Madhu Jain; G.C. Sharma; Richa Sharma<br /><i>International Journal of Mathematics in Operational Research, Vol. 4, No. 1 (2012) pp. 56 - 77</i><br />This paper analyses a discrete&#45;time Geo&amp;lt;SUP align&#61;&#34;right&#34;&amp;gt;X&amp;lt;&#47;SUP&amp;gt;&#47;Geo&#47;1 queue with unreliable server and working vacation. During the vacation period, the server renders service to the primary job at lower rate rather than completely stopping service; this type of vacation is considered as working vacation. For modelling the queueing problem, the inter&#45;arrival time, service time and repair time are treated as discrete random variables. The customers are assumed to arrive at the system in batches according to a geometric process during the consecutive slots. Using the probability generating function method, we obtain the steady&#45;state distribution of the number of the customers in the system. Furthermore, Maximum Entropy Approach &#40;MEA&#41; is employed to obtain the approximate formulae for the probability distributions of the number of customers and the expected waiting time in the system in terms of several well&#45;known results. Finally, the sensitivity analysis is also carried out to illustrate the effect of different parameters on several performance characteristics.</p>]]></content:encoded>
<dc:identifier>10.1504/IJMOR.2012.044473</dc:identifier>
<dc:source>International Journal of Mathematics in Operational Research, Vol. 4, No. 1 (2012) pp. 56 - 77</dc:source>
<dc:creator>Madhu Jain; G.C. Sharma; Richa Sharma</dc:creator>
<dc:contributor>Department of Mathematics, IIT, Roorkee 247667, India. &#39; Department of Mathematics, I.B.S., Khandari, Agra 282002, India. &#39; Department of Mathematics, St. Johns College, Agra 282002, India</dc:contributor>
<dc:subject>discrete&#45;time queues</dc:subject>
<dc:subject>unreliable servers</dc:subject>
<dc:subject>working vacations</dc:subject>
<dc:subject>geometric batch arrivals</dc:subject>
<dc:subject>generating functions</dc:subject>
<dc:subject>maximum entropy</dc:subject>
<dc:subject>queue size</dc:subject>
<dc:subject>waiting times</dc:subject>
<dc:subject>modelling.</dc:subject>
<dc:date>2011-12-26T23:20:50-05:00</dc:date>
<prism:volume>4</prism:volume>
<prism:number>1</prism:number>
<prism:startingPage>56</prism:startingPage>
<prism:endingPage>77</prism:endingPage>
<prism:publicationDate>2011-12-26T23:20:50-05:00</prism:publicationDate>
</item>
<item rdf:about="http://dx.doi.org/10.1504/IJMOR.2012.044474">
<title>MX&#47;G&#47;1 queuing model with state dependent arrival and Second Optional Vacation</title>
<link>http://www.inderscience.com/link.php?id=44474</link>
<description>This investigation deals with single server state dependent queuing systems, wherein the arrivals of units are in batches and follow the Poisson process with state dependent arrival rates. After availing of the First Regular Vacation &#40;FRV&#41; in a case when there is no customer in the system, the server may also take a Second Optional Vacation &#40;SOV&#41;. By using supplementary variable techniques, the probability generating function of the queue length distribution is established to study various performance measures. The maximum entropy approach is also used to find queue length distribution for evaluation of steady state probabilities in all different states. Numerical illustrations are provided to verify the tractability of performance measures obtained analytically.</description>
<content:encoded><![CDATA[<p><a href="http://www.inderscience.com/link.php?id=44474"><b>MX&#47;G&#47;1 queuing model with state dependent arrival and Second Optional Vacation</b></A><br />Charan Jeet Singh; Madhu Jain; Binay Kumar<br /><i>International Journal of Mathematics in Operational Research, Vol. 4, No. 1 (2012) pp. 78 - 96</i><br />This investigation deals with single server state dependent queuing systems, wherein the arrivals of units are in batches and follow the Poisson process with state dependent arrival rates. After availing of the First Regular Vacation &#40;FRV&#41; in a case when there is no customer in the system, the server may also take a Second Optional Vacation &#40;SOV&#41;. By using supplementary variable techniques, the probability generating function of the queue length distribution is established to study various performance measures. The maximum entropy approach is also used to find queue length distribution for evaluation of steady state probabilities in all different states. Numerical illustrations are provided to verify the tractability of performance measures obtained analytically.</p>]]></content:encoded>
<dc:identifier>10.1504/IJMOR.2012.044474</dc:identifier>
<dc:source>International Journal of Mathematics in Operational Research, Vol. 4, No. 1 (2012) pp. 78 - 96</dc:source>
<dc:creator>Charan Jeet Singh; Madhu Jain; Binay Kumar</dc:creator>
<dc:contributor>Department of Mathematics, Guru Nanak Dev University, Amritsar 143005, India. &#39; Department of Mathematics, Indian Institute of Technology, Roorkee 247667, India. &#39; Department of Mathematics, M.L.U. DAV College, Phagwara 144402, India</dc:contributor>
<dc:subject>M</dc:subject>
<dc:subject>right&#34</dc:subject>
<dc:subject>&amp;gt;X&#47;G&#47;1</dc:subject>
<dc:subject>bulk arrivals</dc:subject>
<dc:subject>queue length</dc:subject>
<dc:subject>state dependent rate</dc:subject>
<dc:subject>optional vacations</dc:subject>
<dc:subject>supplementary variables</dc:subject>
<dc:subject>maximum entropy</dc:subject>
<dc:subject>queuing models</dc:subject>
<dc:subject>modelling.</dc:subject>
<dc:date>2011-12-26T23:20:50-05:00</dc:date>
<prism:volume>4</prism:volume>
<prism:number>1</prism:number>
<prism:startingPage>78</prism:startingPage>
<prism:endingPage>96</prism:endingPage>
<prism:publicationDate>2011-12-26T23:20:50-05:00</prism:publicationDate>
</item>
</rdf:RDF>

