Optimal and heuristic multi-level lot sizing with extensions, in an MRP environment : branch and bound approach

dc.contributor.advisorKhumawala, Basheer M.
dc.contributor.committeeMemberSteinberg, Earle
dc.contributor.committeeMemberScamell, Richard W.
dc.contributor.committeeMemberKretlow, William J.
dc.creatorPrentis, Eric Latimer
dc.date.accessioned2023-06-22T17:00:57Z
dc.date.available2023-06-22T17:00:57Z
dc.date.copyright1985-03-14
dc.date.issued1984
dc.description.abstractProduction and inventory management in the multi level manufacturing environment is a major concern of ongoing industrial corporations. Management systems to plan and control the operations function are a prominent factor in a firm's competitive position and long term prosperity. A closed loop material requirements planning (MRP) system is one such system that gives management information necessary to make quantity and timing decisions for materials (purchased parts and raw materials, components, subassemblies, assemblies, etc.) in a complex, fast paced working environment. An integral part of the MRP system is lot sizing which has a direct bearing on quantity and timing decisions. Research on lot sizing is extensive, however very little has been performed on the most prevalent type found in industry (i.e. for the multi level, multi component, multi parent, multi period, hereafter called general case, problem). This research presents a solution procedure, branch and bound (B&B), for the general case lot sizing problem with extensions in a closed loop MRP environment. [...]
dc.description.departmentBusiness, C. T. Bauer College of
dc.format.digitalOriginreformatted digital
dc.format.mimetypeapplication/pdf
dc.identifier.other11499456
dc.identifier.urihttps://hdl.handle.net/10657/14665
dc.language.isoen
dc.rightsThis item is protected by copyright but is made available here under a claim of fair use (17 U.S.C. Section 107) for non-profit research and educational purposes. Users of this work assume the responsibility for determining copyright status prior to reusing, publishing, or reproducing this item for purposes other than what is allowed by fair use or other copyright exemptions. Any reuse of this item in excess of fair use or other copyright exemptions requires express permission of the copyright holder.
dc.subjectMaterials management
dc.subjectProduction management
dc.subjectBranch and bound algorithms
dc.titleOptimal and heuristic multi-level lot sizing with extensions, in an MRP environment : branch and bound approach
dc.type.dcmiText
dc.type.genreThesis
dcterms.accessRightsThe full text of this item is not available at this time because it contains documents that are presumed to be under copyright and are accessible only to users who have an active CougarNet ID. This item will continue to be made available through interlibrary loan.
thesis.degree.collegeC. T. Bauer College of Business
thesis.degree.departmentBusiness Administration, College of
thesis.degree.disciplineBusiness Administration
thesis.degree.grantorUniversity of Houston
thesis.degree.levelDoctoral
thesis.degree.nameDoctor of Philosophy

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Prentis_1984_11499456.pdf
Size:
6.23 MB
Format:
Adobe Portable Document Format