Bibliothek

X
Suchhistorie löschen
feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    Digitale Medien
    Digitale Medien
    Schedule efficiency in a robotic production cell (1995)
    Springer
    International journal of flexible manufacturing systems 7 (1995), S. 5-26 
    Details
    ISSN: 1572-9370
    Schlagwort(e): cell configuration ; cycle time ; linear programming method ; longest path method ; movement network ; movement schedule (cycle) ; part input sequence ; sequence processing time ; waiting time
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Maschinenbau
    Notizen: Abstract In this paper, we analyze the efficiency of a given robot movement schedule for the case of a flow shop robotic production cell withm different machines, one input conveyor, and one output conveyor. We begin with the case of one-robot cells and extend our results to multirobot cells. The paper studies the efficiency of a movement schedule for identical parts by defining a movement network associated with this schedule. This network models any cell layout and applies to multirobot cells. Using the movement network, we propose two cycle time evaluation methods, the first using linear programming and the second based on finding a longest path. The latter method generates a procedure to obtain an analytical formula for the cycle time. We extend the proposed methods to study the efficiency of a given input sequence (schedule) for different parts, that is, to determine the sequence processing time. The results obtained here allow us to quickly evaluate the efficiency of any given feasible movement schedule, for identical or different parts.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF01324877
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 2
    Digitale Medien
    Digitale Medien
    An algorithm for network dimensioning under reliability considerations (1992)
    Springer
    Annals of operations research 36 (1992), S. 263-274 
    Details
    ISSN: 1572-9338
    Schlagwort(e): Network dimensioning ; telecommunications ; reliability ; circuit switching ; routing
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik , Wirtschaftswissenschaften
    Notizen: Abstract In this paper we introduce a new methodology to adjust link capacities in circuit switched networks taking into account the costing policy and reliability considerations. This methodology, which is an extension of previous work on reliability evaluation using routing models, is based on a cyclic decomposition algorithm which alternates between a routing subproblem and a link capacity adjustment subproblem. The proposed procedure, which is shown to converge to a global optimum for the dimensioning/routing problem, has been tested on a 14 undirected arc problem for various levels of link failure probability. The numerical results are extremely satisfactory and they demonstrate the usefulness of the proposed method for proper network dimensioning.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF02094333
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...