35 research outputs found
Maximally permissive deadlock avoidance for sequential resource allocation systems using disjunctions of linear classifiers
No full textA recent line of work has sought the implementation of the maximally permissive deadlock avoidance policy (DAP) for a broad class of complex resource allocation systems (RAS) as a classifier that gives effective and parsimonious representation to the dichotomy of the underlying behavioral space into the admissible and inadmissible subspaces defined by the target policy. The considered RAS class pertains also to the management of the lock allocation in multi-threaded software. The work presented in this paper complements the past developments in this area by providing (i) succinct conditions regarding the possibility of expressing the aforementioned classifier as a set of linear inequalities in the RAS state variables, and (ii) an efficient customized algorithm for the synthesis of pertinent non-linear classifiers that implement the target DAP with minimum run-time computational overhead, in the case that a linear-classifier-based representation of this policy is not possible
Designing optimal deadlock avoidance policies for sequential resource allocation systems through classification theory: existence results and customized algorithms
No full textA recent line of work has sought the implementation
of the maximally permissive deadlock avoidance policy (DAP) for
a broad class of complex resource allocation systems (RAS) as
a classifier that gives effective and parsimonious representation
to the dichotomy of the underlying behavioral space into the
admissible and inadmissible subspaces defined by that policy. The
work presented in this paper complements the past developments
in this area by providing (i) succinct conditions regarding the
possibility of expressing the aforementioned classifier as a set of
linear inequalities in the RAS state variables, and (ii) an efficient
customized algorithm for the synthesis of pertinent non-linear
classifiers that implement the target DAP with minimum run-time
computational overhead, in the case that a linear-classifier-based
representation of this policy is not possible
The reinforcement learning approach for integrating production and distribution in multi-plant networks
No full text
The Destabilizing Effect of Blocking due to Finite Buffering Capacity in Multi-class Queueing Networks
No full textThis paper demonstrates that blocking due to finite buffering capacity of the system workstations can be a destabilizing factor for distributed scheduling policies applied in multi-class queueing networks, in addition to the currently identified sources of instability. The issue is important since, in practice, all systems modeled by such networks operate under buffering capacity constraints. Keywords: Multi-class Queueing Networks, Stability, Distributed Scheduling Policies, Reentrant Lines * The paper is currently under review for publication in the IEEE Trans. on Automatic. Control. Please, do not cite or reproduce without the author's permission. 1 Introduction This paper revisits the problem of stability of distributed scheduling policies in multi-class queueing networks (QN's). The issue is of considerable practical importance, especially in the semiconductor manufacturing industry where the complexity and the dynamic nature of the operational environment makes dispatching r..
A linear characterization of the Petri net reachability space corresponding to bounded-length fireable transition sequences and its implications for the structural analysis of process-resource nets with acyclic, quasi-live and strongly reversible process subnets.
No full textStructural analysis and control of flexible manufacturing systems with a performance perspective
No full textStrategic objectives in modern discrete-part manufacturing are shifting from the previously sought economies of scale to the so called economies of scope, where emphasis is placed on product variety and customization, as well as the increased responsiveness of the production system to widely fluctuating demands. At the shop-floor level, this new paradigm is enabled by extensive computer driven automation. This, in turn, necessitates the development of formal modeling approaches for the rigorous analysis and design of such systems.In this thesis, an analytical framework is developed for the study of the manufacturing system deadlock. It is shown that, in the general case, solving the problem optimally is computationally intractable. As a result, a design methodology is developed which leads to suboptimal, yet computationally efficient (scalable) solutions, which are, furthermore, provably correct. The resulting policies are characterized as structural control policies (SCP's). Two -SCP's, RUN and RO, designed through this approach, are discussed in detail, while a third policy existing in the literature is shown to belong in the class of -SCP's. In addition, a special case of considerable practical interest is identified, in which the deadlock avoidance problem admits an optimal solution of polynomial complexity.In the second part of the thesis, issues related to the policy performance are considered. Two frameworks for the study of the policy efficiency are proposed. The first evaluates policy efficiency by trying to estimate its proximity to the optimal SCP, and it is used to show that it is possible to exploit some properties of the developed policies in order to obtain closer approximations to the optimal SCP. The second framework addresses the policy efficiency issue by means of more classical performance indices, like production throughputs and resource utilizations.The thesis concludes with a discussion on potential extensions to this work and its integration in the more general production control context.Made available in DSpace on 2011-05-07T12:38:27Z (GMT). No. of bitstreams: 2
license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5)
9712418.pdf: 6787896 bytes, checksum: 82eb577f45ba6b4b8f140e058c6a405a (MD5)
Previous issue date: 1996Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding ([email protected]) on 2011-05-07T14:43:43Z
Item is restricted indefinitely.Restriction data tranferred 2014-07-01T11:19:09-05:00
Original Data
Group with Access UIUC Users [automated]
Release Date: none
Reason: ETDs are only available to UIUC Users without author permissionETDs are only available to UIUC Users without author permissionU of I Onl
Relative value function approximation for the capacitated re-entrant line scheduling problem: an experimental investigation
No full text
