Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 100 (1999), S. 575-597 
    ISSN: 1573-2878
    Keywords: Queueing networks ; scheduling ; stability ; performance evaluation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We obtain new linear programs for bounding the performance and proving the stability of queueing networks. They exploit the key facts that the transition probabilities of queueing networks are shift invariant on the relative interiors of faces and the cost functions of interest are linear in the state. A systematic procedure for choosing different quadratic functions on the relative interiors of faces to serve as surrogates of the differential costs in an inequality relaxation of the average cost function leads to linear program bounds. These bounds are probably better than earlier known bounds. It is also shown how to incorporate additional features, such as the presence of virtual multi-server stations to further improve the bounds. The approach also extends to provide functional bounds valid for all arrival rates.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Queueing systems 13 (1993), S. 87-110 
    ISSN: 1572-9443
    Keywords: Manufacturing systems ; semiconductor manufacturing ; thin film lines ; re-entrant lines ; scheduling policies ; queueing networks ; buffer priority policies ; due date policies ; stability ; stochastic control ; mean delay ; variance of delay ; machine failures ; set-up times
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Traditionally, manufacturing systems have mainly been treated as either job shops or flow shops. In job shops, parts may arrive with random routes, with each route having a low volume. In flow shops, the routes are fixed and acyclic, as in assembly lines. With the advent of semiconductor manufacturing plants, and more recently, thin film lines, this dichotomy needs to be expanded to consider another class of systems, which we call “re-entrant lines”. The distinguishing feature of these manufacturing systems is that parts visit some machines more than once at different stages of processing. Scheduling problems arise because several parts at different stages of processing may be in contention with each other for service at the same machine. There may be uncertainties in the form of random service or set-up times, as well as random machine failures and repairs. The goal of scheduling is to improve performance measures such as mean sojourn time in the system, which is also known as the mean “cycle-time”, or the variance of the cycle-time. In this paper we provide a tutorial account of some recent results in this field. We describe several scheduling policies of interest, and provide some results concerning their stability and performance. Several open problems are suggested.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...