{"id":{"repo_id":"clemson","oai_identifier":"oai:open.clemson.edu:all_theses-1793"},"canonical_url":"https://search.ndltd.org/etd/clemson/oai:open.clemson.edu:all_theses-1793","repository":{"repo_id":"clemson","name":"Clemson University","base_url":"https://open.clemson.edu/do/oai/"},"display":{"title":"MAXIMIZING THROUGHPUT USING DYNAMIC RESOURCE ALLOCATION AND DISCRETE EVENT SIMULATION","abstract":"This research studies a serial two stage production system with two flexible servers which can be dynamically assigned to either station. This is modeled using discrete event simulation and more specifically the Arena software package by Rockwell. The goal is to determine dynamic allocation policies based upon the inventory level at each station to maximize the throughput of finished goods out of the system. This model adds to previous work by including actual switching time. The effect of the pre-emptive resume assumption is gauged, and the effectiveness of the OptQuest optimization package is also tested. Studies are conducted to determine the throughput of the system using easily implementable heuristics including when workers are together and separate. Additionally, the effect of buffer allocation and buffer sizing are studied, and it is shown that buffer allocation is not sensitive to changes in buffer ratio as long as there is buffer space available at each station while adding buffer space has a diminishing rate of return.","abstract_html":"This research studies a serial two stage production system with two flexible servers which can be dynamically assigned to either station. This is modeled using discrete event simulation and more specifically the Arena software package by Rockwell. The goal is to determine dynamic allocation policies based upon the inventory level at each station to maximize the throughput of finished goods out of the system. This model adds to previous work by including actual switching time. The effect of the pre-emptive resume assumption is gauged, and the effectiveness of the OptQuest optimization package is also tested. Studies are conducted to determine the throughput of the system using easily implementable heuristics including when workers are together and separate. Additionally, the effect of buffer allocation and buffer sizing are studied, and it is shown that buffer allocation is not sensitive to changes in buffer ratio as long as there is buffer space available at each station while adding buffer space has a diminishing rate of return.","abstract_has_math":false,"creators":["Gunn, Gregory"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Industrial Engineering","degree_department":null,"school":null,"contributors":["Mayorga, Maria E","Taaffe , Kevin M","Fadel , Georges M"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T07:07:24Z","subjects":["Discrete Event Simulation","Dynamic Resource Allocation","Resource Allocation","Industrial Engineering"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://open.clemson.edu/all_theses/793","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://open.clemson.edu/all_theses/793","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://open.clemson.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Aopen.clemson.edu%3Aall_theses-1793","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Mayorga, Maria E","Taaffe , Kevin M","Fadel , Georges M"]},{"key":"dc:creator","label":"Author","values":["Gunn, Gregory"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2015-09-30T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2010-05-01T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Industrial Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Discrete Event Simulation","Dynamic Resource Allocation","Resource Allocation","Industrial Engineering"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://open.clemson.edu/all_theses/793"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This research studies a serial two stage production system with two flexible servers which can be dynamically assigned to either station. This is modeled using discrete event simulation and more specifically the Arena software package by Rockwell. The goal is to determine dynamic allocation policies based upon the inventory level at each station to maximize the throughput of finished goods out of the system. This model adds to previous work by including actual switching time. The effect of the pre-emptive resume assumption is gauged, and the effectiveness of the OptQuest optimization package is also tested. Studies are conducted to determine the throughput of the system using easily implementable heuristics including when workers are together and separate. Additionally, the effect of buffer allocation and buffer sizing are studied, and it is shown that buffer allocation is not sensitive to changes in buffer ratio as long as there is buffer space available at each station while adding buffer space has a diminishing rate of return."]},{"key":"dc:title","label":"Title","values":["MAXIMIZING THROUGHPUT USING DYNAMIC RESOURCE ALLOCATION AND DISCRETE EVENT SIMULATION"]}]}],"canonical_facts":{"dc:contributor":["Mayorga, Maria E","Taaffe , Kevin M","Fadel , Georges M"],"dc:creator":["Gunn, Gregory"],"dc:date.available":["2015-09-30T07:00:00Z"],"dc:date.created":["2010-05-01T07:00:00Z"],"dc:description.abstract":["This research studies a serial two stage production system with two flexible servers which can be dynamically assigned to either station. This is modeled using discrete event simulation and more specifically the Arena software package by Rockwell. The goal is to determine dynamic allocation policies based upon the inventory level at each station to maximize the throughput of finished goods out of the system. This model adds to previous work by including actual switching time. The effect of the pre-emptive resume assumption is gauged, and the effectiveness of the OptQuest optimization package is also tested. Studies are conducted to determine the throughput of the system using easily implementable heuristics including when workers are together and separate. Additionally, the effect of buffer allocation and buffer sizing are studied, and it is shown that buffer allocation is not sensitive to changes in buffer ratio as long as there is buffer space available at each station while adding buffer space has a diminishing rate of return."],"dc:identifier":["https://open.clemson.edu/all_theses/793"],"dc:subject":["Discrete Event Simulation","Dynamic Resource Allocation","Resource Allocation","Industrial Engineering"],"dc:title":["MAXIMIZING THROUGHPUT USING DYNAMIC RESOURCE ALLOCATION AND DISCRETE EVENT SIMULATION"],"thesis:degree_discipline":["Industrial Engineering"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T07:07:24Z"}