3,423 research outputs found

    The NASA SBIR product catalog

    Get PDF
    The purpose of this catalog is to assist small business firms in making the community aware of products emerging from their efforts in the Small Business Innovation Research (SBIR) program. It contains descriptions of some products that have advanced into Phase 3 and others that are identified as prospective products. Both lists of products in this catalog are based on information supplied by NASA SBIR contractors in responding to an invitation to be represented in this document. Generally, all products suggested by the small firms were included in order to meet the goals of information exchange for SBIR results. Of the 444 SBIR contractors NASA queried, 137 provided information on 219 products. The catalog presents the product information in the technology areas listed in the table of contents. Within each area, the products are listed in alphabetical order by product name and are given identifying numbers. Also included is an alphabetical listing of the companies that have products described. This listing cross-references the product list and provides information on the business activity of each firm. In addition, there are three indexes: one a list of firms by states, one that lists the products according to NASA Centers that managed the SBIR projects, and one that lists the products by the relevant Technical Topics utilized in NASA's annual program solicitation under which each SBIR project was selected

    Asymptotic optimality of maximum pressure policies in stochastic processing networks

    Full text link
    We consider a class of stochastic processing networks. Assume that the networks satisfy a complete resource pooling condition. We prove that each maximum pressure policy asymptotically minimizes the workload process in a stochastic processing network in heavy traffic. We also show that, under each quadratic holding cost structure, there is a maximum pressure policy that asymptotically minimizes the holding cost. A key to the optimality proofs is to prove a state space collapse result and a heavy traffic limit theorem for the network processes under a maximum pressure policy. We extend a framework of Bramson [Queueing Systems Theory Appl. 30 (1998) 89--148] and Williams [Queueing Systems Theory Appl. 30 (1998b) 5--25] from the multiclass queueing network setting to the stochastic processing network setting to prove the state space collapse result and the heavy traffic limit theorem. The extension can be adapted to other studies of stochastic processing networks.Comment: Published in at http://dx.doi.org/10.1214/08-AAP522 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

    A Fuzzy Nonlinear Programming Approach for Optimizing the Performance of a Four-Objective Fluctuation Smoothing Rule in a Wafer Fabrication Factory

    Get PDF
    In theory, a scheduling problem can be formulated as a mathematical programming problem. In practice, dispatching rules are considered to be a more practical method of scheduling. However, the combination of mathematical programming and fuzzy dispatching rule has rarely been discussed in the literature. In this study, a fuzzy nonlinear programming (FNLP) approach is proposed for optimizing the scheduling performance of a four-factor fluctuation smoothing rule in a wafer fabrication factory. The proposed methodology considers the uncertainty in the remaining cycle time of a job and optimizes a fuzzy four-factor fluctuation-smoothing rule to sequence the jobs in front of each machine. The fuzzy four-factor fluctuation-smoothing rule has five adjustable parameters, the optimization of which results in an FNLP problem. The FNLP problem can be converted into an equivalent nonlinear programming (NLP) problem to be solved. The performance of the proposed methodology has been evaluated with a series of production simulation experiments; these experiments provide sufficient evidence to support the advantages of the proposed method over some existing scheduling methods
    corecore