Show simple item record

Real time scheduling problems in a general flexible manufacturing system.

dc.contributor.authorRaman, Narayan
dc.contributor.advisorTalbot, F. Brian
dc.date.accessioned2020-09-09T03:13:11Z
dc.date.available2020-09-09T03:13:11Z
dc.date.issued1988
dc.identifier.urihttps://hdl.handle.net/2027.42/162114
dc.description.abstractThis dissertation addresses three problems which arise during the real-time scheduling of a flexible manufacturing system (FMS) which produces a large variety of part types in relatively small volumes. Two of these problems, the Workcenter Scheduling Problem (WSP) and the Shop Scheduling Problem (SSP) have not been directly addressed by any researcher in the past. While the third problem, the Multiple-Machine Tardiness Problem (MTP) is well-researched, we propose a different solution approach. WSP and MTP consider the objective of minimizing mean tardiness in a dynamic system. The proposed solution approach to both problems requires decomposing the dynamic problem into a series of static problems, and implementing the solutions to these static problems on a rolling basis. WSP considers a single-machine system in which jobs are processed in batches, and a constant changeover time is incurred while switching from one part type to another. We show the static WSP to be NP-complete, and present some characteristics of the optimal sequence. An optimum-seeking and two heuristic solution procedures are developed for this problem. Computational studies indicate the effectiveness of these procedures. MTP addresses a multiple-machine system with r and om material flows. For the static problem, we propose an optimum-seeking method, and a heuristic procedure which generates an active schedule for the entire FMS at each instance. Experimental results reveal that this heuristic method can yield substantial improvement over dispatching rules studied in prior research, for both static and dynamic problems. SSP deals with a static system in which the primary objective is to minimize mean tardiness and the secondary objective is to maximize the sum of job release times. A heuristic solution method is proposed which decomposes SSP into two subproblems. These subproblems address the two objectives independently. Computational studies show the relative merit of addressing the dual-objective problem and the effectiveness of the suggested solution procedure under various test scenarios.
dc.format.extent245 p.
dc.languageEnglish
dc.titleReal time scheduling problems in a general flexible manufacturing system.
dc.typeThesis
dc.description.thesisdegreenamePhDen_US
dc.description.thesisdegreedisciplineBusiness administration
dc.description.thesisdegreedisciplineSystems science
dc.description.thesisdegreegrantorUniversity of Michigan
dc.subject.hlbtoplevelBusiness
dc.subject.hlbtoplevelScience
dc.contributor.affiliationumcampusAnn Arbor
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/162114/1/8907129.pdfen_US
dc.owningcollnameDissertations and Theses (Ph.D. and Master's)


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe its collections in a way that respects the people and communities who create, use, and are represented in them. We encourage you to Contact Us anonymously if you encounter harmful or problematic language in catalog records or finding aids. More information about our policies and practices is available at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.