Integer multiple production schedules for multi-stage systems with finite production rates and startup delays

dc.contributor.advisorMogg, Jack M.
dc.contributor.committeeMemberOstrofsky, Benjamin
dc.contributor.committeeMemberParks, Michael S.
dc.creatorBigham, Paul Evans
dc.date.accessioned2022-06-24T16:18:28Z
dc.date.available2022-06-24T16:18:28Z
dc.date.copyright1977
dc.date.issued1977
dc.description.abstractThe problem considered is that of production scheduling for a multi-stage system in which semi-finished units are passed from stage to stage before emerging as finished product. Each stage is assumed to have a constant finite rate of production greater than the constant rate of demand for the final product. In addition, a continuous review re-order policy and an infinite time horizon are assumed. An optimal production schedule is defined as that set of fixed production cycle times (or, equivalently, fixed production lot sizes) which minimizes the time-averaged total of the setup (and shutdown) costs incurred at each stage, and the costs of holding the inventories which accumulate throughout the system. The basic difficulty encountered is that of accounting for the interdependence of successive stages. In all but the most restricted cases, the initial startup at stage 1 must be delayed relative to that at stage i+1 (the immediate predecessor stage) to avoid stockouts in the inventory held between the two stages. The average size of this inventory is directly effected by the length of such a delay. Since the required delay at stage i is, in general, a non-analytical function of the cycle times chosen for stages i and i+1, the analytical derivation of optimal cycle times is not possible. The approach taken herein is that of first deriving an analytical expression for the lower bound on the total cost associated with a given set of cycle times (i.e., a given production schedule). A theorem is then stated and proved establishing both a necessary and sufficient condition for identifying production schedules with associated total costs achieving their respective lower bounds. Alternative computerized algorithms are presented for finding the least cost solution from among this set of solutions. This approach is extended to allow for finished goods backorders, constraints on average inventory levels, converging branches, and stochastic lead times for raw materials orders.
dc.description.departmentBusiness, C. T. Bauer College of
dc.format.digitalOriginreformatted digital
dc.format.mimetypeapplication/pdf
dc.identifier.other4320701
dc.identifier.urihttps://hdl.handle.net/10657/9977
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.titleInteger multiple production schedules for multi-stage systems with finite production rates and startup delays
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.collegeCollege of Business Administration
thesis.degree.departmentBusiness Administration, College of
thesis.degree.disciplineBusiness Administration
thesis.degree.grantorUniversity of Houston
thesis.degree.levelDoctoral
thesis.degree.nameDoctor of Philosphy in Business Administration

Files

Original bundle

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