{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/67321"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/67321","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"A Study of Monotone Optimal Operating Policy for Some Tandem Queueing System","abstract":"This paper examines a monotone policy as an optimal control rule for a tandem queueing service system with an ordered sequence of N job stages. Each job can be viewed as a single service station. A finite queue is allowed to accumulate before each station.","abstract_html":"This paper examines a monotone policy as an optimal control rule for a tandem queueing service system with an ordered sequence of N job stages. Each job can be viewed as a single service station. A finite queue is allowed to accumulate before each station.","abstract_has_math":false,"creators":["Whang, Kyu-Seung"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Business Administration","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-13T20:21:49Z","date_published":"2014-12-13T20:21:49Z","updated_at":"2026-07-22T22:25:57Z","subjects":["Business Administration, General"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI8026619"],"render_values":[{"text":"(UMI)AAI8026619","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/67321","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Whang, Kyu-Seung"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-13T20:21:49Z","10000-01-01","1980"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Business Administration"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Business Administration, General"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/67321","(UMI)AAI8026619"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["This paper examines a monotone policy as an optimal control rule for a tandem queueing service system with an ordered sequence of N job stages. Each job can be viewed as a single service station. A finite queue is allowed to accumulate before each station.","It is assumed that the system is observed only at discrete points in time, namely, those corresponding to arrivals, service completions, and certain no change events. Customers arrive according to a Poisson process with rate (lamda). A customer who arrives and finds a full queue for station 1 will leave the system. A manager can choose from s(,k) alternative service types or stop the service for each station k whenever he observes the system. Let "a" be a certain action which is chosen by a manager. At each station k, an exponential server possesses a customer at a rate (mu)(,k)(a) if this station is not blocked.","The cost structure includes an operating cost for running each stage, where the rate of operating cost depends on the type of service. A fixed revenue is collected when all stages have been completed.","To determine the optimal control rule, we formulate the system as a discrete-time Markov decision process. The optimality criterion is the total discounted expected cost. We characterize the form of optimal value functions inductively. Applying the characteristics of optimal value functions, we present several monotonic properties of the optimal value policies. We eliminate the inefficient facilities in the optimal policies. In a set of optimal actions, the operating cost rate at each stage is an increasing convex function of the service rate. We show that an optimal action is an antitone function of a discount factor. We present the equivalent results between discrete- and continuous-time Markov decision processes over an infinite time horizon.","Made available in DSpace on 2014-12-13T20:21:49Z (GMT). No. of bitstreams: 1 8026619.pdf: 1796012 bytes, checksum: 671d1a205b6b255cd63dfa5b7355fa90 (MD5) Previous issue date: 1980","Embargo set by: Seth Robbins for item 67499 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","52 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1980."]},{"key":"dc:title","label":"Title","values":["A Study of Monotone Optimal Operating Policy for Some Tandem Queueing System"]}]}],"canonical_facts":{"dc:creator":["Whang, Kyu-Seung"],"dc:date":["2014-12-13T20:21:49Z","10000-01-01","1980"],"dc:description":["This paper examines a monotone policy as an optimal control rule for a tandem queueing service system with an ordered sequence of N job stages. Each job can be viewed as a single service station. A finite queue is allowed to accumulate before each station.","It is assumed that the system is observed only at discrete points in time, namely, those corresponding to arrivals, service completions, and certain no change events. Customers arrive according to a Poisson process with rate (lamda). A customer who arrives and finds a full queue for station 1 will leave the system. A manager can choose from s(,k) alternative service types or stop the service for each station k whenever he observes the system. Let "a" be a certain action which is chosen by a manager. At each station k, an exponential server possesses a customer at a rate (mu)(,k)(a) if this station is not blocked.","The cost structure includes an operating cost for running each stage, where the rate of operating cost depends on the type of service. A fixed revenue is collected when all stages have been completed.","To determine the optimal control rule, we formulate the system as a discrete-time Markov decision process. The optimality criterion is the total discounted expected cost. We characterize the form of optimal value functions inductively. Applying the characteristics of optimal value functions, we present several monotonic properties of the optimal value policies. We eliminate the inefficient facilities in the optimal policies. In a set of optimal actions, the operating cost rate at each stage is an increasing convex function of the service rate. We show that an optimal action is an antitone function of a discount factor. We present the equivalent results between discrete- and continuous-time Markov decision processes over an infinite time horizon.","Made available in DSpace on 2014-12-13T20:21:49Z (GMT). No. of bitstreams: 1 8026619.pdf: 1796012 bytes, checksum: 671d1a205b6b255cd63dfa5b7355fa90 (MD5) Previous issue date: 1980","Embargo set by: Seth Robbins for item 67499 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","52 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1980."],"dc:identifier":["http://hdl.handle.net/2142/67321","(UMI)AAI8026619"],"dc:language":["eng"],"dc:subject":["Business Administration, General"],"dc:title":["A Study of Monotone Optimal Operating Policy for Some Tandem Queueing System"],"dc:type":["text"],"thesis:degree_discipline":["Business Administration"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:57Z"}