• Login
    View Item 
    •   Home
    • UA Graduate and Undergraduate Research
    • UA Theses and Dissertations
    • Dissertations
    • View Item
    •   Home
    • UA Graduate and Undergraduate Research
    • UA Theses and Dissertations
    • Dissertations
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of UA Campus RepositoryCommunitiesTitleAuthorsIssue DateSubmit DateSubjectsPublisherJournalThis CollectionTitleAuthorsIssue DateSubmit DateSubjectsPublisherJournal

    My Account

    LoginRegister

    About

    AboutUA Faculty PublicationsUA DissertationsUA Master's ThesesUA Honors ThesesUA PressUA YearbooksUA CatalogsUA Libraries

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Optimization schemes for queueing networks with applications to flexible manufacturing systems.

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    azu_td_9103040_sip1_m.pdf
    Size:
    4.336Mb
    Format:
    PDF
    Description:
    azu_td_9103040_sip1_m.pdf
    Download
    Author
    Krisht, Ali Hussein
    Issue Date
    1990
    Keywords
    Engineering
    Advisor
    Askin, Ronald G.
    
    Metadata
    Show full item record
    Publisher
    The University of Arizona.
    Rights
    Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
    Abstract
    Product-form queueing networks have been useful for modeling complex systems such as flexible manufacturing systems and computer systems. While the literature is rich with queueing models, little attention has been paid to the use of these models in optimization schemes. This dissertation addresses the optimal design of complex systems in conjunction with closed queueing network theory. The overall plan is as follows: Product-form queueing network models are used to evaluate system "performance measures" for a given setting of system "decision parameters". The performance measures are useful in the computation of system cost functions and/or their sensitivities with respect to decision parameters. Optimization algorithms are applied in order to find the set of decision parameter values which optimize performance measures and/or minimize the cost of the system. Typical performance measures are the throughput (production rate) and average queue lengths at individual nodes of the system. Sensitivities of performance measures with respect to the decision parameters are derived in closed-form. These sensitivities are used to study the concavity (convexity) properties of performance measures. Both the concavity properties and the sensitivities of performance measures are then utilized in the formulation and solution procedures of the optimization models. Decision variables for the design and operation of queueing systems include service rates, routing of jobs, number of servers, and level of work-in-process. Models with a single decision variable type, such as service rates, are considered first. Hybrid models which include several types of decision variables such as service rates and work-in-process levels are then addressed. Constraints include meeting production goals, capital budgeting, and bounds on decision variables. The optimization models are discussed and solved to optimality. Numerical examples are provided and results are analysed.
    Type
    text
    Dissertation-Reproduction (electronic)
    Degree Name
    Ph.D.
    Degree Level
    doctoral
    Degree Program
    Systems and Industrial Engineering
    Graduate College
    Degree Grantor
    University of Arizona
    Collections
    Dissertations

    entitlement

     
    The University of Arizona Libraries | 1510 E. University Blvd. | Tucson, AZ 85721-0055
    Tel 520-621-6442 | repository@u.library.arizona.edu
    DSpace software copyright © 2002-2017  DuraSpace
    Quick Guide | Contact Us | Send Feedback
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.