{"id":{"repo_id":"usf","oai_identifier":"oai:digitalcommons.usf.edu:etd-3435"},"canonical_url":"https://search.ndltd.org/etd/usf/oai:digitalcommons.usf.edu:etd-3435","repository":{"repo_id":"usf","name":"University of South Florida","base_url":"https://digitalcommons.usf.edu/do/oai/"},"display":{"title":"Continuous Time Disaggregation in Hierarchical Production Planning","abstract":"One of the objectives of disaggregation in hierarchical production planning is to minimize the setup costs incurred when changing production from one family to another. In this research, the setup costs are reduced by determining a production schedule that minimizes the number of setups during the planning horizon. Previous solutions to the disaggregation problem have considered discrete-time, and more recently continuous-time formulations. This research extends the continuous time disaggregation approach by incorporating production schedules allowing backorder. A mathematical formulation and a solution algorithm are presented and the computational complexity and convergence properties of the algorithm are discussed. Experimental results, using both deterministic and stochastic demand patterns, which demonstrate the efficacies of the solution approach are provided.","abstract_html":"One of the objectives of disaggregation in hierarchical production planning is to minimize the setup costs incurred when changing production from one family to another. In this research, the setup costs are reduced by determining a production schedule that minimizes the number of setups during the planning horizon. Previous solutions to the disaggregation problem have considered discrete-time, and more recently continuous-time formulations. This research extends the continuous time disaggregation approach by incorporating production schedules allowing backorder. A mathematical formulation and a solution algorithm are presented and the computational complexity and convergence properties of the algorithm are discussed. Experimental results, using both deterministic and stochastic demand patterns, which demonstrate the efficacies of the solution approach are provided.","abstract_has_math":false,"creators":["Al-Tamimi, Rami Salhab"],"institution":"University of South Florida","degree_name":null,"degree_level":"Thesis","degree_discipline":"Industrial Engineering","degree_department":null,"school":null,"contributors":["Ali Yalcin, Ph.D.","Susana Lai-Yuen, Ph.D.","Michael Weng, Ph.D."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2006,"date_issued":"2006-01-01T08:00:00Z","date_published":"2006-01-01T08:00:00Z","updated_at":"2026-11-19T08:35:22Z","subjects":["Production schedule","Family level","Minimize setup cost","Production cycle","Stochastic demand","Out-of-stock percentage","American Studies","Arts and Humanities"],"languages":["EN-US"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usf.edu/etd/2436","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usf.edu/etd/2436","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://digitalcommons.usf.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.usf.edu%3Aetd-3435","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Ali Yalcin, Ph.D.","Susana Lai-Yuen, Ph.D.","Michael Weng, Ph.D."]},{"key":"dc:creator","label":"Author","values":["Al-Tamimi, Rami Salhab"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2006-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Industrial Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis","M.S.I.E."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of South Florida"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Production schedule","Family level","Minimize setup cost","Production cycle","Stochastic demand","Out-of-stock percentage","American Studies","Arts and Humanities"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["EN-US"]},{"key":"dc:rights.license","label":"Dc Rights License","values":["default"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usf.edu/etd/2436"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["One of the objectives of disaggregation in hierarchical production planning is to minimize the setup costs incurred when changing production from one family to another. In this research, the setup costs are reduced by determining a production schedule that minimizes the number of setups during the planning horizon. Previous solutions to the disaggregation problem have considered discrete-time, and more recently continuous-time formulations. This research extends the continuous time disaggregation approach by incorporating production schedules allowing backorder. A mathematical formulation and a solution algorithm are presented and the computational complexity and convergence properties of the algorithm are discussed. Experimental results, using both deterministic and stochastic demand patterns, which demonstrate the efficacies of the solution approach are provided."]},{"key":"dc:title","label":"Title","values":["Continuous Time Disaggregation in Hierarchical Production Planning"]}]}],"canonical_facts":{"dc:contributor":["Ali Yalcin, Ph.D.","Susana Lai-Yuen, Ph.D.","Michael Weng, Ph.D."],"dc:creator":["Al-Tamimi, Rami Salhab"],"dc:date":["2006-01-01T08:00:00Z"],"dc:description":["One of the objectives of disaggregation in hierarchical production planning is to minimize the setup costs incurred when changing production from one family to another. In this research, the setup costs are reduced by determining a production schedule that minimizes the number of setups during the planning horizon. Previous solutions to the disaggregation problem have considered discrete-time, and more recently continuous-time formulations. This research extends the continuous time disaggregation approach by incorporating production schedules allowing backorder. A mathematical formulation and a solution algorithm are presented and the computational complexity and convergence properties of the algorithm are discussed. Experimental results, using both deterministic and stochastic demand patterns, which demonstrate the efficacies of the solution approach are provided."],"dc:identifier":["https://digitalcommons.usf.edu/etd/2436"],"dc:language":["EN-US"],"dc:rights.license":["default"],"dc:subject":["Production schedule","Family level","Minimize setup cost","Production cycle","Stochastic demand","Out-of-stock percentage","American Studies","Arts and Humanities"],"dc:title":["Continuous Time Disaggregation in Hierarchical Production Planning"],"thesis:degree_discipline":["Industrial Engineering"],"thesis:degree_level":["Thesis","M.S.I.E."],"thesis:institution_name":["University of South Florida"]},"updated_at":"2026-11-19T08:35:22Z"}