15 research outputs found

    Makespan Minimization in Re-entrant Permutation Flow Shops

    Get PDF
    Re-entrant permutation flow shop problems occur in practical applications such as wafer manufacturing, paint shops, mold and die processes and textile industry. A re-entrant material flow means that the production jobs need to visit at least one working station multiple times. A comprehensive review gives an overview of the literature on re-entrant scheduling. The influence of missing operations received just little attention so far and splitting the jobs into sublots was not examined in re-entrant permutation flow shops before. The computational complexity of makespan minimization in re-entrant permutation flow shop problems requires heuristic solution approaches for large problem sizes. The problem provides promising structural properties for the application of a variable neighborhood search because of the repeated processing of jobs on several machines. Furthermore the different characteristics of lot streaming and their impact on the makespan of a schedule are examined in this thesis and the heuristic solution methods are adjusted to manage the problem’s extension

    Optimisation de la performance de systèmes multi-composants assujettis à des défaillances aléatoires

    Get PDF

    Solving Multi-objective Integer Programs using Convex Preference Cones

    Get PDF
    Esta encuesta tiene dos objetivos: en primer lugar, identificar a los individuos que fueron víctimas de algún tipo de delito y la manera en que ocurrió el mismo. En segundo lugar, medir la eficacia de las distintas autoridades competentes una vez que los individuos denunciaron el delito que sufrieron. Adicionalmente la ENVEI busca indagar las percepciones que los ciudadanos tienen sobre las instituciones de justicia y el estado de derecho en Méxic

    Incorporating declared capacity uncertainty in optimizing airport slot allocation

    Get PDF
    Slot allocation is the mechanism used to allocate capacity at congested airports. A number of models have been introduced in the literature aiming to produce airport schedules that optimize the allocation of slot requests to the available airport capacity. A critical parameter affecting the outcome of the slot allocation process is the airport’s declared capacity. Existing airport slot allocation models treat declared capacity as an exogenously defined deterministic parameter. In this presentation we propose a new robust optimization formulation based on the concept of stability radius. The proposed formulation considers endogenously the airport’s declared capacity and expresses it as a function of its throughput. We present results from the application of the proposed approach to a congested airport and we discuss the trade-off between the declared capacity of the airport and the efficiency of the slot allocation process

    MS FT-2-2 7 Orthogonal polynomials and quadrature: Theory, computation, and applications

    Get PDF
    Quadrature rules find many applications in science and engineering. Their analysis is a classical area of applied mathematics and continues to attract considerable attention. This seminar brings together speakers with expertise in a large variety of quadrature rules. It is the aim of the seminar to provide an overview of recent developments in the analysis of quadrature rules. The computation of error estimates and novel applications also are described

    Generalized averaged Gaussian quadrature and applications

    Get PDF
    A simple numerical method for constructing the optimal generalized averaged Gaussian quadrature formulas will be presented. These formulas exist in many cases in which real positive GaussKronrod formulas do not exist, and can be used as an adequate alternative in order to estimate the error of a Gaussian rule. We also investigate the conditions under which the optimal averaged Gaussian quadrature formulas and their truncated variants are internal
    corecore