{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/45230"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/45230","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"The impact of \"Never Run Out\" policy assured supply chain with dual reorder point expediting","abstract":"Managing a big supply chain for one of the largest quick service restaurant companies, especially when the company has a policy called \"Never Run Out,\" is very challenging. A traditional way of managing inventory requires high level of safety stock if high level of uncertainty is involved. Sources of uncertainty include variability in demand from frequent promotions or seasonal effect, variability in order lead time from using low-cost mode of transportation, or lack of information sharing. This project developed an expediting policy with dual reorder points with demand threshold and tested the policy with a Monte Carlo simulation. Previous research on two reorder points provide great foundation for this study but they lack consideration on demand variability and approaches to set up reorder points. We propose an algorithm with a demand threshold to trigger an expedited order and heuristic approaches to develop reorder points where the total cost can be minimized while service requirements are met.","abstract_html":"Managing a big supply chain for one of the largest quick service restaurant companies, especially when the company has a policy called "Never Run Out," is very challenging. A traditional way of managing inventory requires high level of safety stock if high level of uncertainty is involved. Sources of uncertainty include variability in demand from frequent promotions or seasonal effect, variability in order lead time from using low-cost mode of transportation, or lack of information sharing. This project developed an expediting policy with dual reorder points with demand threshold and tested the policy with a Monte Carlo simulation. Previous research on two reorder points provide great foundation for this study but they lack consideration on demand variability and approaches to set up reorder points. We propose an algorithm with a demand threshold to trigger an expedited order and heuristic approaches to develop reorder points where the total cost can be minimized while service requirements are met.","abstract_has_math":false,"creators":["Lee, Gil Su"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Engineering Systems Division.","school":null,"contributors":[],"advisors":["Chris Caplice."],"committee_chairs":[],"committee_members":[],"year":2008,"date_issued":"2008","date_published":"2008","updated_at":"2026-07-22T22:20:52Z","subjects":["Engineering Systems Division."],"languages":["eng"],"rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/45230","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Chris Caplice."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Engineering Systems Division."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Engineering Systems Division."]},{"key":"dc:creator","label":"Author","values":["Lee, Gil Su"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2009-04-29T17:11:59Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2009-04-29T17:11:59Z"]},{"key":"dc:date.issued","label":"Date","values":["2008"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Engineering Systems Division."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/45230"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (M. Eng. in Logistics)--Massachusetts Institute of Technology, Engineering Systems Division, 2008.","Includes bibliographical references (leaves 64-65)."]},{"key":"dc:description.abstract","label":"Abstract","values":["Managing a big supply chain for one of the largest quick service restaurant companies, especially when the company has a policy called \"Never Run Out,\" is very challenging. A traditional way of managing inventory requires high level of safety stock if high level of uncertainty is involved. Sources of uncertainty include variability in demand from frequent promotions or seasonal effect, variability in order lead time from using low-cost mode of transportation, or lack of information sharing. This project developed an expediting policy with dual reorder points with demand threshold and tested the policy with a Monte Carlo simulation. Previous research on two reorder points provide great foundation for this study but they lack consideration on demand variability and approaches to set up reorder points. We propose an algorithm with a demand threshold to trigger an expedited order and heuristic approaches to develop reorder points where the total cost can be minimized while service requirements are met."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng.in Logistics"]},{"key":"dc:title","label":"Title","values":["The impact of \"Never Run Out\" policy assured supply chain with dual reorder point expediting"]}]}],"canonical_facts":{"dc:contributor.advisor":["Chris Caplice."],"dc:contributor.department":["Massachusetts Institute of Technology. Engineering Systems Division."],"dc:contributor.other":["Massachusetts Institute of Technology. Engineering Systems Division."],"dc:creator":["Lee, Gil Su"],"dc:date.accessioned":["2009-04-29T17:11:59Z"],"dc:date.available":["2009-04-29T17:11:59Z"],"dc:date.issued":["2008"],"dc:description":["Thesis (M. Eng. in Logistics)--Massachusetts Institute of Technology, Engineering Systems Division, 2008.","Includes bibliographical references (leaves 64-65)."],"dc:description.abstract":["Managing a big supply chain for one of the largest quick service restaurant companies, especially when the company has a policy called \"Never Run Out,\" is very challenging. A traditional way of managing inventory requires high level of safety stock if high level of uncertainty is involved. Sources of uncertainty include variability in demand from frequent promotions or seasonal effect, variability in order lead time from using low-cost mode of transportation, or lack of information sharing. This project developed an expediting policy with dual reorder points with demand threshold and tested the policy with a Monte Carlo simulation. Previous research on two reorder points provide great foundation for this study but they lack consideration on demand variability and approaches to set up reorder points. We propose an algorithm with a demand threshold to trigger an expedited order and heuristic approaches to develop reorder points where the total cost can be minimized while service requirements are met."],"dc:description.degree":["M.Eng.in Logistics"],"dc:identifier.uri":["http://hdl.handle.net/1721.1/45230"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Engineering Systems Division."],"dc:title":["The impact of \"Never Run Out\" policy assured supply chain with dual reorder point expediting"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:20:52Z"}