{"id":{"repo_id":"marshall","oai_identifier":"oai:mds.marshall.edu:etd-1699"},"canonical_url":"https://search.ndltd.org/etd/marshall/oai:mds.marshall.edu:etd-1699","repository":{"repo_id":"marshall","name":"Marshall University","base_url":"https://mds.marshall.edu/do/oai/"},"display":{"title":"Non-Preemptive Shunting in M/M/1 and Dynamic Service Queueing Systems","abstract":"We provide a study of two queueing systems, namely, an M/M/1 queueing system in which an incoming customer shunts, or skips line, and a dynamic server in an infinite capacity system moving among service nodes. In the former, we explore various aspects of the system, including waiting time, and the relationships between shunting and position in queue and rate of service. Through use of global balance equations, we find the probability that an arriving non-priority customer, finding customers waiting in the system, will shunt to a position other than behind the queue. In the latter, we explore a system in which a server with infinite capacity moves among indexed linear service nodes, receives customers at various nodes, and transports the customers to other indexed nodes in the hierarchy. We determine the expected waiting times at the nodes, expected service times, expected number of customers at a given node, expected number in the system, and expected number in service. The probabilities that an arrival finds n customers at a particular node, and in the entire system are obtained.","abstract_html":"We provide a study of two queueing systems, namely, an M/M/1 queueing system in which an incoming customer shunts, or skips line, and a dynamic server in an infinite capacity system moving among service nodes. In the former, we explore various aspects of the system, including waiting time, and the relationships between shunting and position in queue and rate of service. Through use of global balance equations, we find the probability that an arriving non-priority customer, finding customers waiting in the system, will shunt to a position other than behind the queue. In the latter, we explore a system in which a server with infinite capacity moves among indexed linear service nodes, receives customers at various nodes, and transports the customers to other indexed nodes in the hierarchy. We determine the expected waiting times at the nodes, expected service times, expected number of customers at a given node, expected number in the system, and expected number in service. The probabilities that an arrival finds n customers at a particular node, and in the entire system are obtained.","abstract_has_math":false,"creators":["Lacek, Steven"],"institution":null,"degree_name":"Mathematics","degree_level":"Thesis","degree_discipline":"College of Science","degree_department":null,"school":null,"contributors":["Alfred Akinsete","Yulia Dementieva","Ariyadasa Aluthge"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-21T19:56:27Z","subjects":["Applied Mathematics","Dynamical Systems","Dynamic Systems","Mathematics","Physical Sciences and Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://mds.marshall.edu/etd/697","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://mds.marshall.edu/etd/697","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://mds.marshall.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Amds.marshall.edu%3Aetd-1699","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Alfred Akinsete","Yulia Dementieva","Ariyadasa Aluthge"]},{"key":"dc:creator","label":"Author","values":["Lacek, Steven"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2013-10-10T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2008-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["College of Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Mathematics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Applied Mathematics","Dynamical Systems","Dynamic Systems","Mathematics","Physical Sciences and Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://mds.marshall.edu/etd/697"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["We provide a study of two queueing systems, namely, an M/M/1 queueing system in which an incoming customer shunts, or skips line, and a dynamic server in an infinite capacity system moving among service nodes. In the former, we explore various aspects of the system, including waiting time, and the relationships between shunting and position in queue and rate of service. Through use of global balance equations, we find the probability that an arriving non-priority customer, finding customers waiting in the system, will shunt to a position other than behind the queue. In the latter, we explore a system in which a server with infinite capacity moves among indexed linear service nodes, receives customers at various nodes, and transports the customers to other indexed nodes in the hierarchy. We determine the expected waiting times at the nodes, expected service times, expected number of customers at a given node, expected number in the system, and expected number in service. The probabilities that an arrival finds n customers at a particular node, and in the entire system are obtained."]},{"key":"dc:title","label":"Title","values":["Non-Preemptive Shunting in M/M/1 and Dynamic Service Queueing Systems"]}]}],"canonical_facts":{"dc:contributor":["Alfred Akinsete","Yulia Dementieva","Ariyadasa Aluthge"],"dc:creator":["Lacek, Steven"],"dc:date.available":["2013-10-10T07:00:00Z"],"dc:date.created":["2008-01-01T08:00:00Z"],"dc:description.abstract":["We provide a study of two queueing systems, namely, an M/M/1 queueing system in which an incoming customer shunts, or skips line, and a dynamic server in an infinite capacity system moving among service nodes. In the former, we explore various aspects of the system, including waiting time, and the relationships between shunting and position in queue and rate of service. Through use of global balance equations, we find the probability that an arriving non-priority customer, finding customers waiting in the system, will shunt to a position other than behind the queue. In the latter, we explore a system in which a server with infinite capacity moves among indexed linear service nodes, receives customers at various nodes, and transports the customers to other indexed nodes in the hierarchy. We determine the expected waiting times at the nodes, expected service times, expected number of customers at a given node, expected number in the system, and expected number in service. The probabilities that an arrival finds n customers at a particular node, and in the entire system are obtained."],"dc:identifier":["https://mds.marshall.edu/etd/697"],"dc:subject":["Applied Mathematics","Dynamical Systems","Dynamic Systems","Mathematics","Physical Sciences and Mathematics"],"dc:title":["Non-Preemptive Shunting in M/M/1 and Dynamic Service Queueing Systems"],"thesis:degree_discipline":["College of Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Mathematics"]},"updated_at":"2026-11-21T19:56:27Z"}