{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/91125"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/91125","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"Mathematical model and optimization of an interleaving warehouse layout","abstract":"This research is devoted to the development of a mathematical model for an Interleaving Warehouse Layout. The space allocated to the items in the warehouse is most commonly determined on the basis of inventory cost of the items. Once the space requirements for the items are computed, the actual assignment of items to locations in the warehouse is carried out independently. An Interleaving Warehouse Layout is presented in this research to incorporate both reorder quantity and location of each item in a single comprehensive mathematical model of the warehouse. The advantage of this approach is that it considers the quantity and location problems encountered in a warehouse layout simultaneously. The mathematical model developed for the warehouse layout is optimized utilizing the computer code GRG2.5. The numerical results for two warehouses are summarized, discussed and compared with the data available in the literature.","abstract_html":"This research is devoted to the development of a mathematical model for an Interleaving Warehouse Layout. The space allocated to the items in the warehouse is most commonly determined on the basis of inventory cost of the items. Once the space requirements for the items are computed, the actual assignment of items to locations in the warehouse is carried out independently. An Interleaving Warehouse Layout is presented in this research to incorporate both reorder quantity and location of each item in a single comprehensive mathematical model of the warehouse. The advantage of this approach is that it considers the quantity and location problems encountered in a warehouse layout simultaneously. The mathematical model developed for the warehouse layout is optimized utilizing the computer code GRG2.5. The numerical results for two warehouses are summarized, discussed and compared with the data available in the literature.","abstract_has_math":false,"creators":["Jadeja, Bhoopatsinh Udaysinh"],"institution":"Virginia Polytechnic Institute and State University","degree_name":"M.S.","degree_level":"masters","degree_discipline":"Industrial Engineering and Operations Research","degree_department":"Industrial Engineering and Operations Research","school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1985,"date_issued":"1985","date_published":"1985","updated_at":"2026-07-22T22:19:06Z","subjects":[],"languages":["en_US"],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10919/91125","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.department","label":"Department","values":["Industrial Engineering and Operations Research"]},{"key":"dc:creator","label":"Author","values":["Jadeja, Bhoopatsinh Udaysinh"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2019-07-03T20:33:54Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2019-07-03T20:33:54Z"]},{"key":"dc:date.issued","label":"Date","values":["1985"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Polytechnic Institute and State University"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.dcmitype","label":"Dc Type Dcmitype","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Industrial Engineering and Operations Research"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/91125"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This research is devoted to the development of a mathematical model for an Interleaving Warehouse Layout. The space allocated to the items in the warehouse is most commonly determined on the basis of inventory cost of the items. Once the space requirements for the items are computed, the actual assignment of items to locations in the warehouse is carried out independently. An Interleaving Warehouse Layout is presented in this research to incorporate both reorder quantity and location of each item in a single comprehensive mathematical model of the warehouse. The advantage of this approach is that it considers the quantity and location problems encountered in a warehouse layout simultaneously. The mathematical model developed for the warehouse layout is optimized utilizing the computer code GRG2.5. The numerical results for two warehouses are summarized, discussed and compared with the data available in the literature."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.S."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Mathematical model and optimization of an interleaving warehouse layout"]}]}],"canonical_facts":{"dc:contributor.department":["Industrial Engineering and Operations Research"],"dc:creator":["Jadeja, Bhoopatsinh Udaysinh"],"dc:date.accessioned":["2019-07-03T20:33:54Z"],"dc:date.available":["2019-07-03T20:33:54Z"],"dc:date.issued":["1985"],"dc:description.abstract":["This research is devoted to the development of a mathematical model for an Interleaving Warehouse Layout. The space allocated to the items in the warehouse is most commonly determined on the basis of inventory cost of the items. Once the space requirements for the items are computed, the actual assignment of items to locations in the warehouse is carried out independently. An Interleaving Warehouse Layout is presented in this research to incorporate both reorder quantity and location of each item in a single comprehensive mathematical model of the warehouse. The advantage of this approach is that it considers the quantity and location problems encountered in a warehouse layout simultaneously. The mathematical model developed for the warehouse layout is optimized utilizing the computer code GRG2.5. The numerical results for two warehouses are summarized, discussed and compared with the data available in the literature."],"dc:description.degree":["M.S."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/10919/91125"],"dc:language.iso":["en_US"],"dc:publisher":["Virginia Polytechnic Institute and State University"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:title":["Mathematical model and optimization of an interleaving warehouse layout"],"dc:type":["Thesis"],"dc:type.dcmitype":["Text"],"thesis:degree_discipline":["Industrial Engineering and Operations Research"],"thesis:degree_level":["masters"],"thesis:degree_name":["M.S."],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-22T22:19:06Z"}