On a queueing-inventory with reservation, cancellation, common life time and retrial
In this paper we model a queueing-inventory system that has applications in railway and airline reservation systems. Maximum items in the inventory is $$S$$ S which have a random common life time; this includes those that are sold in particular cycle. A customer, on arrival to an idle server with at...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Krishnamoorthy, A [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2016 |
|---|
| Rechteinformationen: |
Nutzungsrecht: © Springer Science+Business Media New York 2016 |
|---|
| Schlagwörter: |
|---|
| Übergeordnetes Werk: |
Enthalten in: Annals of operations research - Dordrecht, The Netherlands : Springer Nature B.V., 1984, 247(2016), 1, Seite 365-389 |
|---|---|
| Übergeordnetes Werk: |
volume:247 ; year:2016 ; number:1 ; pages:365-389 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10479-015-1849-x |
|---|
| Katalog-ID: |
OLC1988726212 |
|---|
| LEADER | 01000caa a2200265 4500 | ||
|---|---|---|---|
| 001 | OLC1988726212 | ||
| 003 | DE-627 | ||
| 005 | 20230715022842.0 | ||
| 007 | tu | ||
| 008 | 170207s2016 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10479-015-1849-x |2 doi | |
| 028 | 5 | 2 | |a PQ20170206 |
| 035 | |a (DE-627)OLC1988726212 | ||
| 035 | |a (DE-599)GBVOLC1988726212 | ||
| 035 | |a (PRQ)c1975-a35be9bb4fea70573e913cdd12b79914203b3a7a95c62b1a1a3f3899d83113d80 | ||
| 035 | |a (KEY)0133795520160000247000100365onaqueueinginventorywithreservationcancellationcom | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q DNB |
| 100 | 1 | |a Krishnamoorthy, A |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a On a queueing-inventory with reservation, cancellation, common life time and retrial |
| 264 | 1 | |c 2016 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 520 | |a In this paper we model a queueing-inventory system that has applications in railway and airline reservation systems. Maximum items in the inventory is $$S$$ S which have a random common life time; this includes those that are sold in particular cycle. A customer, on arrival to an idle server with at least one item in inventory, is immediately taken for service; or else he joins the buffer of maximum size $$S$$ S depending on number of items in the inventory (the buffer capacity varies and is, at any time, equal to the number of items in the inventory). The arrival of customers constitutes a Poisson process, demanding exactly one item each from the inventory. If there is no item in the inventory, the arriving customer first queue up in a finite waiting space of capacity $$K$$ K . When it overflows an arrival goes to an orbit of infinite capacity with probability $$p$$ p or is lost forever with probability $$1-p$$ 1 - p . From the orbit he retries for service according to an exponentially distributed inter-occurrence time. The service time follows an exponential distribution. Cancellation of sold items before its expiry is permitted. Inventory gets added through cancellation of purchased items, until the expiry time. Cancellation time is assumed to be negligible. We analyze this system. Several performance characteristics are computed; expected sojourn time of the system in a cycle with “no inventory” and also “maximum inventory” are computed. Some illustrative numerical examples are presented. An optimization problem is numerically analyzed. | ||
| 540 | |a Nutzungsrecht: © Springer Science+Business Media New York 2016 | ||
| 650 | 4 | |a Queueing-inventory system | |
| 650 | 4 | |a Operation Research/Decision Theory | |
| 650 | 4 | |a Cancellation | |
| 650 | 4 | |a Reservation | |
| 650 | 4 | |a Combinatorics | |
| 650 | 4 | |a Business and Management | |
| 650 | 4 | |a Common life time | |
| 650 | 4 | |a Theory of Computation | |
| 650 | 4 | |a Retrial queue | |
| 650 | 4 | |a Reservation systems | |
| 650 | 4 | |a Studies | |
| 650 | 4 | |a Operations research | |
| 650 | 4 | |a Queuing | |
| 700 | 1 | |a Shajin, Dhanya |4 oth | |
| 700 | 1 | |a Lakshmy, B |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |t Annals of operations research |d Dordrecht, The Netherlands : Springer Nature B.V., 1984 |g 247(2016), 1, Seite 365-389 |w (DE-627)12964370X |w (DE-600)252629-3 |w (DE-576)018141862 |x 0254-5330 |
| 773 | 1 | 8 | |g volume:247 |g year:2016 |g number:1 |g pages:365-389 |
| 856 | 4 | 1 | |u http://dx.doi.org/10.1007/s10479-015-1849-x |3 Volltext |
| 856 | 4 | 2 | |u http://search.proquest.com/docview/1837004266 |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-WIW | ||
| 912 | |a SSG-OLC-MAT | ||
| 951 | |a AR | ||
| 952 | |d 247 |j 2016 |e 1 |h 365-389 | ||
| author_variant |
a k ak |
|---|---|
| matchkey_str |
article:02545330:2016----::nqeenivnoyiheevtocneltocm |
| hierarchy_sort_str |
2016 |
| publishDate |
2016 |
| allfields |
10.1007/s10479-015-1849-x doi PQ20170206 (DE-627)OLC1988726212 (DE-599)GBVOLC1988726212 (PRQ)c1975-a35be9bb4fea70573e913cdd12b79914203b3a7a95c62b1a1a3f3899d83113d80 (KEY)0133795520160000247000100365onaqueueinginventorywithreservationcancellationcom DE-627 ger DE-627 rakwb eng 004 DNB Krishnamoorthy, A verfasserin aut On a queueing-inventory with reservation, cancellation, common life time and retrial 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier In this paper we model a queueing-inventory system that has applications in railway and airline reservation systems. Maximum items in the inventory is $$S$$ S which have a random common life time; this includes those that are sold in particular cycle. A customer, on arrival to an idle server with at least one item in inventory, is immediately taken for service; or else he joins the buffer of maximum size $$S$$ S depending on number of items in the inventory (the buffer capacity varies and is, at any time, equal to the number of items in the inventory). The arrival of customers constitutes a Poisson process, demanding exactly one item each from the inventory. If there is no item in the inventory, the arriving customer first queue up in a finite waiting space of capacity $$K$$ K . When it overflows an arrival goes to an orbit of infinite capacity with probability $$p$$ p or is lost forever with probability $$1-p$$ 1 - p . From the orbit he retries for service according to an exponentially distributed inter-occurrence time. The service time follows an exponential distribution. Cancellation of sold items before its expiry is permitted. Inventory gets added through cancellation of purchased items, until the expiry time. Cancellation time is assumed to be negligible. We analyze this system. Several performance characteristics are computed; expected sojourn time of the system in a cycle with “no inventory” and also “maximum inventory” are computed. Some illustrative numerical examples are presented. An optimization problem is numerically analyzed. Nutzungsrecht: © Springer Science+Business Media New York 2016 Queueing-inventory system Operation Research/Decision Theory Cancellation Reservation Combinatorics Business and Management Common life time Theory of Computation Retrial queue Reservation systems Studies Operations research Queuing Shajin, Dhanya oth Lakshmy, B oth Enthalten in Annals of operations research Dordrecht, The Netherlands : Springer Nature B.V., 1984 247(2016), 1, Seite 365-389 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:247 year:2016 number:1 pages:365-389 http://dx.doi.org/10.1007/s10479-015-1849-x Volltext http://search.proquest.com/docview/1837004266 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT AR 247 2016 1 365-389 |
| spelling |
10.1007/s10479-015-1849-x doi PQ20170206 (DE-627)OLC1988726212 (DE-599)GBVOLC1988726212 (PRQ)c1975-a35be9bb4fea70573e913cdd12b79914203b3a7a95c62b1a1a3f3899d83113d80 (KEY)0133795520160000247000100365onaqueueinginventorywithreservationcancellationcom DE-627 ger DE-627 rakwb eng 004 DNB Krishnamoorthy, A verfasserin aut On a queueing-inventory with reservation, cancellation, common life time and retrial 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier In this paper we model a queueing-inventory system that has applications in railway and airline reservation systems. Maximum items in the inventory is $$S$$ S which have a random common life time; this includes those that are sold in particular cycle. A customer, on arrival to an idle server with at least one item in inventory, is immediately taken for service; or else he joins the buffer of maximum size $$S$$ S depending on number of items in the inventory (the buffer capacity varies and is, at any time, equal to the number of items in the inventory). The arrival of customers constitutes a Poisson process, demanding exactly one item each from the inventory. If there is no item in the inventory, the arriving customer first queue up in a finite waiting space of capacity $$K$$ K . When it overflows an arrival goes to an orbit of infinite capacity with probability $$p$$ p or is lost forever with probability $$1-p$$ 1 - p . From the orbit he retries for service according to an exponentially distributed inter-occurrence time. The service time follows an exponential distribution. Cancellation of sold items before its expiry is permitted. Inventory gets added through cancellation of purchased items, until the expiry time. Cancellation time is assumed to be negligible. We analyze this system. Several performance characteristics are computed; expected sojourn time of the system in a cycle with “no inventory” and also “maximum inventory” are computed. Some illustrative numerical examples are presented. An optimization problem is numerically analyzed. Nutzungsrecht: © Springer Science+Business Media New York 2016 Queueing-inventory system Operation Research/Decision Theory Cancellation Reservation Combinatorics Business and Management Common life time Theory of Computation Retrial queue Reservation systems Studies Operations research Queuing Shajin, Dhanya oth Lakshmy, B oth Enthalten in Annals of operations research Dordrecht, The Netherlands : Springer Nature B.V., 1984 247(2016), 1, Seite 365-389 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:247 year:2016 number:1 pages:365-389 http://dx.doi.org/10.1007/s10479-015-1849-x Volltext http://search.proquest.com/docview/1837004266 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT AR 247 2016 1 365-389 |
| allfields_unstemmed |
10.1007/s10479-015-1849-x doi PQ20170206 (DE-627)OLC1988726212 (DE-599)GBVOLC1988726212 (PRQ)c1975-a35be9bb4fea70573e913cdd12b79914203b3a7a95c62b1a1a3f3899d83113d80 (KEY)0133795520160000247000100365onaqueueinginventorywithreservationcancellationcom DE-627 ger DE-627 rakwb eng 004 DNB Krishnamoorthy, A verfasserin aut On a queueing-inventory with reservation, cancellation, common life time and retrial 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier In this paper we model a queueing-inventory system that has applications in railway and airline reservation systems. Maximum items in the inventory is $$S$$ S which have a random common life time; this includes those that are sold in particular cycle. A customer, on arrival to an idle server with at least one item in inventory, is immediately taken for service; or else he joins the buffer of maximum size $$S$$ S depending on number of items in the inventory (the buffer capacity varies and is, at any time, equal to the number of items in the inventory). The arrival of customers constitutes a Poisson process, demanding exactly one item each from the inventory. If there is no item in the inventory, the arriving customer first queue up in a finite waiting space of capacity $$K$$ K . When it overflows an arrival goes to an orbit of infinite capacity with probability $$p$$ p or is lost forever with probability $$1-p$$ 1 - p . From the orbit he retries for service according to an exponentially distributed inter-occurrence time. The service time follows an exponential distribution. Cancellation of sold items before its expiry is permitted. Inventory gets added through cancellation of purchased items, until the expiry time. Cancellation time is assumed to be negligible. We analyze this system. Several performance characteristics are computed; expected sojourn time of the system in a cycle with “no inventory” and also “maximum inventory” are computed. Some illustrative numerical examples are presented. An optimization problem is numerically analyzed. Nutzungsrecht: © Springer Science+Business Media New York 2016 Queueing-inventory system Operation Research/Decision Theory Cancellation Reservation Combinatorics Business and Management Common life time Theory of Computation Retrial queue Reservation systems Studies Operations research Queuing Shajin, Dhanya oth Lakshmy, B oth Enthalten in Annals of operations research Dordrecht, The Netherlands : Springer Nature B.V., 1984 247(2016), 1, Seite 365-389 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:247 year:2016 number:1 pages:365-389 http://dx.doi.org/10.1007/s10479-015-1849-x Volltext http://search.proquest.com/docview/1837004266 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT AR 247 2016 1 365-389 |
| allfieldsGer |
10.1007/s10479-015-1849-x doi PQ20170206 (DE-627)OLC1988726212 (DE-599)GBVOLC1988726212 (PRQ)c1975-a35be9bb4fea70573e913cdd12b79914203b3a7a95c62b1a1a3f3899d83113d80 (KEY)0133795520160000247000100365onaqueueinginventorywithreservationcancellationcom DE-627 ger DE-627 rakwb eng 004 DNB Krishnamoorthy, A verfasserin aut On a queueing-inventory with reservation, cancellation, common life time and retrial 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier In this paper we model a queueing-inventory system that has applications in railway and airline reservation systems. Maximum items in the inventory is $$S$$ S which have a random common life time; this includes those that are sold in particular cycle. A customer, on arrival to an idle server with at least one item in inventory, is immediately taken for service; or else he joins the buffer of maximum size $$S$$ S depending on number of items in the inventory (the buffer capacity varies and is, at any time, equal to the number of items in the inventory). The arrival of customers constitutes a Poisson process, demanding exactly one item each from the inventory. If there is no item in the inventory, the arriving customer first queue up in a finite waiting space of capacity $$K$$ K . When it overflows an arrival goes to an orbit of infinite capacity with probability $$p$$ p or is lost forever with probability $$1-p$$ 1 - p . From the orbit he retries for service according to an exponentially distributed inter-occurrence time. The service time follows an exponential distribution. Cancellation of sold items before its expiry is permitted. Inventory gets added through cancellation of purchased items, until the expiry time. Cancellation time is assumed to be negligible. We analyze this system. Several performance characteristics are computed; expected sojourn time of the system in a cycle with “no inventory” and also “maximum inventory” are computed. Some illustrative numerical examples are presented. An optimization problem is numerically analyzed. Nutzungsrecht: © Springer Science+Business Media New York 2016 Queueing-inventory system Operation Research/Decision Theory Cancellation Reservation Combinatorics Business and Management Common life time Theory of Computation Retrial queue Reservation systems Studies Operations research Queuing Shajin, Dhanya oth Lakshmy, B oth Enthalten in Annals of operations research Dordrecht, The Netherlands : Springer Nature B.V., 1984 247(2016), 1, Seite 365-389 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:247 year:2016 number:1 pages:365-389 http://dx.doi.org/10.1007/s10479-015-1849-x Volltext http://search.proquest.com/docview/1837004266 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT AR 247 2016 1 365-389 |
| allfieldsSound |
10.1007/s10479-015-1849-x doi PQ20170206 (DE-627)OLC1988726212 (DE-599)GBVOLC1988726212 (PRQ)c1975-a35be9bb4fea70573e913cdd12b79914203b3a7a95c62b1a1a3f3899d83113d80 (KEY)0133795520160000247000100365onaqueueinginventorywithreservationcancellationcom DE-627 ger DE-627 rakwb eng 004 DNB Krishnamoorthy, A verfasserin aut On a queueing-inventory with reservation, cancellation, common life time and retrial 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier In this paper we model a queueing-inventory system that has applications in railway and airline reservation systems. Maximum items in the inventory is $$S$$ S which have a random common life time; this includes those that are sold in particular cycle. A customer, on arrival to an idle server with at least one item in inventory, is immediately taken for service; or else he joins the buffer of maximum size $$S$$ S depending on number of items in the inventory (the buffer capacity varies and is, at any time, equal to the number of items in the inventory). The arrival of customers constitutes a Poisson process, demanding exactly one item each from the inventory. If there is no item in the inventory, the arriving customer first queue up in a finite waiting space of capacity $$K$$ K . When it overflows an arrival goes to an orbit of infinite capacity with probability $$p$$ p or is lost forever with probability $$1-p$$ 1 - p . From the orbit he retries for service according to an exponentially distributed inter-occurrence time. The service time follows an exponential distribution. Cancellation of sold items before its expiry is permitted. Inventory gets added through cancellation of purchased items, until the expiry time. Cancellation time is assumed to be negligible. We analyze this system. Several performance characteristics are computed; expected sojourn time of the system in a cycle with “no inventory” and also “maximum inventory” are computed. Some illustrative numerical examples are presented. An optimization problem is numerically analyzed. Nutzungsrecht: © Springer Science+Business Media New York 2016 Queueing-inventory system Operation Research/Decision Theory Cancellation Reservation Combinatorics Business and Management Common life time Theory of Computation Retrial queue Reservation systems Studies Operations research Queuing Shajin, Dhanya oth Lakshmy, B oth Enthalten in Annals of operations research Dordrecht, The Netherlands : Springer Nature B.V., 1984 247(2016), 1, Seite 365-389 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:247 year:2016 number:1 pages:365-389 http://dx.doi.org/10.1007/s10479-015-1849-x Volltext http://search.proquest.com/docview/1837004266 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT AR 247 2016 1 365-389 |
| language |
English |
| source |
Enthalten in Annals of operations research 247(2016), 1, Seite 365-389 volume:247 year:2016 number:1 pages:365-389 |
| sourceStr |
Enthalten in Annals of operations research 247(2016), 1, Seite 365-389 volume:247 year:2016 number:1 pages:365-389 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Queueing-inventory system Operation Research/Decision Theory Cancellation Reservation Combinatorics Business and Management Common life time Theory of Computation Retrial queue Reservation systems Studies Operations research Queuing |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Annals of operations research |
| authorswithroles_txt_mv |
Krishnamoorthy, A @@aut@@ Shajin, Dhanya @@oth@@ Lakshmy, B @@oth@@ |
| publishDateDaySort_date |
2016-01-01T00:00:00Z |
| hierarchy_top_id |
12964370X |
| dewey-sort |
14 |
| id |
OLC1988726212 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1988726212</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230715022842.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">170207s2016 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10479-015-1849-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20170206</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1988726212</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1988726212</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c1975-a35be9bb4fea70573e913cdd12b79914203b3a7a95c62b1a1a3f3899d83113d80</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0133795520160000247000100365onaqueueinginventorywithreservationcancellationcom</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Krishnamoorthy, A</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On a queueing-inventory with reservation, cancellation, common life time and retrial</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In this paper we model a queueing-inventory system that has applications in railway and airline reservation systems. Maximum items in the inventory is $$S$$ S which have a random common life time; this includes those that are sold in particular cycle. A customer, on arrival to an idle server with at least one item in inventory, is immediately taken for service; or else he joins the buffer of maximum size $$S$$ S depending on number of items in the inventory (the buffer capacity varies and is, at any time, equal to the number of items in the inventory). The arrival of customers constitutes a Poisson process, demanding exactly one item each from the inventory. If there is no item in the inventory, the arriving customer first queue up in a finite waiting space of capacity $$K$$ K . When it overflows an arrival goes to an orbit of infinite capacity with probability $$p$$ p or is lost forever with probability $$1-p$$ 1 - p . From the orbit he retries for service according to an exponentially distributed inter-occurrence time. The service time follows an exponential distribution. Cancellation of sold items before its expiry is permitted. Inventory gets added through cancellation of purchased items, until the expiry time. Cancellation time is assumed to be negligible. We analyze this system. Several performance characteristics are computed; expected sojourn time of the system in a cycle with “no inventory” and also “maximum inventory” are computed. Some illustrative numerical examples are presented. An optimization problem is numerically analyzed.</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="a">Nutzungsrecht: © Springer Science+Business Media New York 2016</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Queueing-inventory system</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operation Research/Decision Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cancellation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Reservation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Business and Management</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Common life time</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory of Computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Retrial queue</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Reservation systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Studies</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations research</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Queuing</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shajin, Dhanya</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lakshmy, B</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Annals of operations research</subfield><subfield code="d">Dordrecht, The Netherlands : Springer Nature B.V., 1984</subfield><subfield code="g">247(2016), 1, Seite 365-389</subfield><subfield code="w">(DE-627)12964370X</subfield><subfield code="w">(DE-600)252629-3</subfield><subfield code="w">(DE-576)018141862</subfield><subfield code="x">0254-5330</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:247</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:365-389</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1007/s10479-015-1849-x</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://search.proquest.com/docview/1837004266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">247</subfield><subfield code="j">2016</subfield><subfield code="e">1</subfield><subfield code="h">365-389</subfield></datafield></record></collection>
|
| author |
Krishnamoorthy, A |
| spellingShingle |
Krishnamoorthy, A ddc 004 misc Queueing-inventory system misc Operation Research/Decision Theory misc Cancellation misc Reservation misc Combinatorics misc Business and Management misc Common life time misc Theory of Computation misc Retrial queue misc Reservation systems misc Studies misc Operations research misc Queuing On a queueing-inventory with reservation, cancellation, common life time and retrial |
| authorStr |
Krishnamoorthy, A |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)12964370X |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0254-5330 |
| topic_title |
004 DNB On a queueing-inventory with reservation, cancellation, common life time and retrial Queueing-inventory system Operation Research/Decision Theory Cancellation Reservation Combinatorics Business and Management Common life time Theory of Computation Retrial queue Reservation systems Studies Operations research Queuing |
| topic |
ddc 004 misc Queueing-inventory system misc Operation Research/Decision Theory misc Cancellation misc Reservation misc Combinatorics misc Business and Management misc Common life time misc Theory of Computation misc Retrial queue misc Reservation systems misc Studies misc Operations research misc Queuing |
| topic_unstemmed |
ddc 004 misc Queueing-inventory system misc Operation Research/Decision Theory misc Cancellation misc Reservation misc Combinatorics misc Business and Management misc Common life time misc Theory of Computation misc Retrial queue misc Reservation systems misc Studies misc Operations research misc Queuing |
| topic_browse |
ddc 004 misc Queueing-inventory system misc Operation Research/Decision Theory misc Cancellation misc Reservation misc Combinatorics misc Business and Management misc Common life time misc Theory of Computation misc Retrial queue misc Reservation systems misc Studies misc Operations research misc Queuing |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| author2_variant |
d s ds b l bl |
| hierarchy_parent_title |
Annals of operations research |
| hierarchy_parent_id |
12964370X |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Annals of operations research |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 |
| title |
On a queueing-inventory with reservation, cancellation, common life time and retrial |
| ctrlnum |
(DE-627)OLC1988726212 (DE-599)GBVOLC1988726212 (PRQ)c1975-a35be9bb4fea70573e913cdd12b79914203b3a7a95c62b1a1a3f3899d83113d80 (KEY)0133795520160000247000100365onaqueueinginventorywithreservationcancellationcom |
| title_full |
On a queueing-inventory with reservation, cancellation, common life time and retrial |
| author_sort |
Krishnamoorthy, A |
| journal |
Annals of operations research |
| journalStr |
Annals of operations research |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2016 |
| contenttype_str_mv |
txt |
| container_start_page |
365 |
| author_browse |
Krishnamoorthy, A |
| container_volume |
247 |
| class |
004 DNB |
| format_se |
Aufsätze |
| author-letter |
Krishnamoorthy, A |
| doi_str_mv |
10.1007/s10479-015-1849-x |
| dewey-full |
004 |
| title_sort |
on a queueing-inventory with reservation, cancellation, common life time and retrial |
| title_auth |
On a queueing-inventory with reservation, cancellation, common life time and retrial |
| abstract |
In this paper we model a queueing-inventory system that has applications in railway and airline reservation systems. Maximum items in the inventory is $$S$$ S which have a random common life time; this includes those that are sold in particular cycle. A customer, on arrival to an idle server with at least one item in inventory, is immediately taken for service; or else he joins the buffer of maximum size $$S$$ S depending on number of items in the inventory (the buffer capacity varies and is, at any time, equal to the number of items in the inventory). The arrival of customers constitutes a Poisson process, demanding exactly one item each from the inventory. If there is no item in the inventory, the arriving customer first queue up in a finite waiting space of capacity $$K$$ K . When it overflows an arrival goes to an orbit of infinite capacity with probability $$p$$ p or is lost forever with probability $$1-p$$ 1 - p . From the orbit he retries for service according to an exponentially distributed inter-occurrence time. The service time follows an exponential distribution. Cancellation of sold items before its expiry is permitted. Inventory gets added through cancellation of purchased items, until the expiry time. Cancellation time is assumed to be negligible. We analyze this system. Several performance characteristics are computed; expected sojourn time of the system in a cycle with “no inventory” and also “maximum inventory” are computed. Some illustrative numerical examples are presented. An optimization problem is numerically analyzed. |
| abstractGer |
In this paper we model a queueing-inventory system that has applications in railway and airline reservation systems. Maximum items in the inventory is $$S$$ S which have a random common life time; this includes those that are sold in particular cycle. A customer, on arrival to an idle server with at least one item in inventory, is immediately taken for service; or else he joins the buffer of maximum size $$S$$ S depending on number of items in the inventory (the buffer capacity varies and is, at any time, equal to the number of items in the inventory). The arrival of customers constitutes a Poisson process, demanding exactly one item each from the inventory. If there is no item in the inventory, the arriving customer first queue up in a finite waiting space of capacity $$K$$ K . When it overflows an arrival goes to an orbit of infinite capacity with probability $$p$$ p or is lost forever with probability $$1-p$$ 1 - p . From the orbit he retries for service according to an exponentially distributed inter-occurrence time. The service time follows an exponential distribution. Cancellation of sold items before its expiry is permitted. Inventory gets added through cancellation of purchased items, until the expiry time. Cancellation time is assumed to be negligible. We analyze this system. Several performance characteristics are computed; expected sojourn time of the system in a cycle with “no inventory” and also “maximum inventory” are computed. Some illustrative numerical examples are presented. An optimization problem is numerically analyzed. |
| abstract_unstemmed |
In this paper we model a queueing-inventory system that has applications in railway and airline reservation systems. Maximum items in the inventory is $$S$$ S which have a random common life time; this includes those that are sold in particular cycle. A customer, on arrival to an idle server with at least one item in inventory, is immediately taken for service; or else he joins the buffer of maximum size $$S$$ S depending on number of items in the inventory (the buffer capacity varies and is, at any time, equal to the number of items in the inventory). The arrival of customers constitutes a Poisson process, demanding exactly one item each from the inventory. If there is no item in the inventory, the arriving customer first queue up in a finite waiting space of capacity $$K$$ K . When it overflows an arrival goes to an orbit of infinite capacity with probability $$p$$ p or is lost forever with probability $$1-p$$ 1 - p . From the orbit he retries for service according to an exponentially distributed inter-occurrence time. The service time follows an exponential distribution. Cancellation of sold items before its expiry is permitted. Inventory gets added through cancellation of purchased items, until the expiry time. Cancellation time is assumed to be negligible. We analyze this system. Several performance characteristics are computed; expected sojourn time of the system in a cycle with “no inventory” and also “maximum inventory” are computed. Some illustrative numerical examples are presented. An optimization problem is numerically analyzed. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT |
| container_issue |
1 |
| title_short |
On a queueing-inventory with reservation, cancellation, common life time and retrial |
| url |
http://dx.doi.org/10.1007/s10479-015-1849-x http://search.proquest.com/docview/1837004266 |
| remote_bool |
false |
| author2 |
Shajin, Dhanya Lakshmy, B |
| author2Str |
Shajin, Dhanya Lakshmy, B |
| ppnlink |
12964370X |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth |
| doi_str |
10.1007/s10479-015-1849-x |
| up_date |
2024-07-03T18:59:47.983Z |
| _version_ |
1803585520124559360 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1988726212</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230715022842.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">170207s2016 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10479-015-1849-x</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20170206</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1988726212</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1988726212</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c1975-a35be9bb4fea70573e913cdd12b79914203b3a7a95c62b1a1a3f3899d83113d80</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0133795520160000247000100365onaqueueinginventorywithreservationcancellationcom</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Krishnamoorthy, A</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On a queueing-inventory with reservation, cancellation, common life time and retrial</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In this paper we model a queueing-inventory system that has applications in railway and airline reservation systems. Maximum items in the inventory is $$S$$ S which have a random common life time; this includes those that are sold in particular cycle. A customer, on arrival to an idle server with at least one item in inventory, is immediately taken for service; or else he joins the buffer of maximum size $$S$$ S depending on number of items in the inventory (the buffer capacity varies and is, at any time, equal to the number of items in the inventory). The arrival of customers constitutes a Poisson process, demanding exactly one item each from the inventory. If there is no item in the inventory, the arriving customer first queue up in a finite waiting space of capacity $$K$$ K . When it overflows an arrival goes to an orbit of infinite capacity with probability $$p$$ p or is lost forever with probability $$1-p$$ 1 - p . From the orbit he retries for service according to an exponentially distributed inter-occurrence time. The service time follows an exponential distribution. Cancellation of sold items before its expiry is permitted. Inventory gets added through cancellation of purchased items, until the expiry time. Cancellation time is assumed to be negligible. We analyze this system. Several performance characteristics are computed; expected sojourn time of the system in a cycle with “no inventory” and also “maximum inventory” are computed. Some illustrative numerical examples are presented. An optimization problem is numerically analyzed.</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="a">Nutzungsrecht: © Springer Science+Business Media New York 2016</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Queueing-inventory system</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operation Research/Decision Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cancellation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Reservation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Business and Management</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Common life time</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory of Computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Retrial queue</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Reservation systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Studies</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations research</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Queuing</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shajin, Dhanya</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lakshmy, B</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Annals of operations research</subfield><subfield code="d">Dordrecht, The Netherlands : Springer Nature B.V., 1984</subfield><subfield code="g">247(2016), 1, Seite 365-389</subfield><subfield code="w">(DE-627)12964370X</subfield><subfield code="w">(DE-600)252629-3</subfield><subfield code="w">(DE-576)018141862</subfield><subfield code="x">0254-5330</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:247</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:365-389</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1007/s10479-015-1849-x</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://search.proquest.com/docview/1837004266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">247</subfield><subfield code="j">2016</subfield><subfield code="e">1</subfield><subfield code="h">365-389</subfield></datafield></record></collection>
|
| score |
7.401101 |