Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • 2010-2014  (1)
  • 1990-1994  (4)
  • 1
    Electronic Resource
    Electronic Resource
    Optimal strip sequencing strategies for flexible manufacturing operations in two and three dimensions (1994)
    Springer
    International journal of flexible manufacturing systems 6 (1994), S. 123-135 
    Details
    ISSN: 1572-9370
    Keywords: strip strategies ; flexible manufacturing ; traveling salesman problem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract In this paper, optimal strip strategies are developed for a variety of two-dimensional and three-dimensional sequencing problems arising in flexible manufacturing. These strategies are appropriate for CNC drilling operations, NC punching operations, and circuit board population, for example. Seven different metrics are considered.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01328808
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Centralized and decentralized stochastic routing models in telecommunication networks (1993)
    Springer
    Telecommunication systems 1 (1993), S. 133-148 
    Details
    ISSN: 1572-9451
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract With the advent of non-hierarchical routing in circuit-switched telecommunication networks, on-line routing policies have been developed with the objective of optimizing some measure of gain or performance. These policies are decentralized. However, traditional planning models are centralized models. We present a decentralized routing model to be used in network planning. We compare it theoretically and empirically with a centralized multicommodity flow model previously presented. The two models are solved by the same type of algorithm, a convex simplex implementation, adapted differently according to the model. Comparative results between planning models reproducing the two policies are discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02136158
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Dimensioning telephone networks with budget constraints (1993)
    Springer
    Telecommunication systems 1 (1993), S. 149-177 
    Details
    ISSN: 1572-9451
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract We present a theoretical study of a modified version of the dimensioning problem for telephone networks where the network does not contain any existing capacity and where the available capital is severely limited, a situation which can occur in private networks as well as in the public networks of developing countries. In the latter, case, the budget constraint is generally of paramount importance. This has two effects. First, the grade of service constraint is replaced by a budget constraint. Another difference from the original problem arises because the network may be operating under overload most of the time. This paper examines some cases of overload for which the link ordering is maintained. The main result of this paper is the derivation of a set of equations similar to the classical optimality equations that lead to the ECCS method, but for the modified version of the problem. As a consequence, we expect that it will be possible to obtain a fast iterative heuristic algorithm similar to the one currently used to solve the classical problem. A number of other points of theoretical interest are also discussed, mainly with the objective of gaining insight into the structure of the modified problem.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02136159
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    An algorithm for network dimensioning under reliability considerations (1992)
    Springer
    Annals of operations research 36 (1992), S. 263-274 
    Details
    ISSN: 1572-9338
    Keywords: Network dimensioning ; telecommunications ; reliability ; circuit switching ; routing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: 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.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02094333
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    facet.materialart.
    Unknown
    Recoverable robust single day aircraft maintenance routing problem (2014)
    Details
    Publication Date: 2023-02-06
    Description: Aircraft maintenance planning is of critical importance to the safe and efficient operations of an airline. It is common to solve the aircraft routing and maintenance planning problems many months in advance, with the solution spanning multiple days. An unfortunate consequence of this approach is the possible infeasibility of the maintenance plan due to frequent perturbations occurring in operations. There is an emerging concept that focuses on the generation of aircraft routes for a single day to ensure maintenance coverage that night, alleviating the effects of schedule perturbations from preceding days. In this paper, we present a novel approach to ensure that a sufficient number of aircraft routes are provided each day so maintenance critical aircraft receive maintenance that night. By penalising the under supply of routes terminating at maintenance stations from each overnight airport, we construct a single day routing to provide the best possible maintenance plan. This single day aircraft maintenance routing problem (SDAMRP) is further protected from disruptions by applying the recoverable robustness framework. To efficiently solve the recoverable robust SDAMRP acceleration techniques, such as identifying Pareto-optimal cuts and a trust region approach, have been applied. The SDAMRP is evaluated against a set of flight schedules and the results demonstrate a significantly improved aircraft maintenance plan. Further, the results demonstrate the magnitude of recoverability improvement that is achieved by employing recoverable robustness to the SDAMRP.
    Language: English
    Type: article , doc-type:article
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...