Recursos de colección

RiuNet. Repositorio institucional de la Universitat de Valencia (73.332 recursos)

RiuNet es el Repositorio Institucional de la Universitat Politècnica de València, gestionado por la Biblioteca, cuyo objetivo es ofrecer acceso en Internet a la producción científica, académica y corporativa de la comunidad universitaria con la finalidad de aumentar su visibilidad y hacerla accesible y preservable.

Mostrando recursos 1 - 6 de 6

  1. Solving the Traveling Salesman Problem Based on The Genetic Reactive Bone Route Algorithm whit Ant Colony System

    Yousefikhoshbakht, Majid; Malekzadeh, Nasrin; Sedighpour, Mohammad
    The TSP is considered one of the most well-known combinatorial optimization tasks and researchers have paid so much attention to the TSP for many years. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The objective is to minimize the total distance traveled by the salesman.  Because this problem is a non-deterministic polynomial (NP-hard) problem in nature, a hybrid meta-heuristic algorithm called REACSGA is used for solving the TSP. In REACSGA, a reactive bone route algorithm that uses the ant colony system...

  2. Industrial Engineering: creating a network!

    Prado-Prado, José Carlos
    [EN] This paper presents a brief history of the Industrial Engineering Conference (CIO), and specially reinforces the role of the CIOs as a forum for building a network and creating log-term relationships

  3. Hybrid genetic algorithms: solutions in realistic dynamic and setup dependent job-shop scheduling problems

    Branco, Rogério M.; Coelho, Antônio S.; Mayerle, Sérgio F.
    This paper discusses the application of heuristic-based evolutionary technique in search for solutions concerning the dynamic job-shop scheduling problems with dependent setup times and alternate routes. With a combinatorial nature, these problems belong to an NP-hard class, with an aggravated condition when in realistic, dynamic and therefore, more complex cases than the traditional static ones. The proposed genetic algorithm executes two important functions: choose the routes using dispatching rules when forming each individual from a defined set of available machines and, also make the scheduling for each of these individuals created. The chromosome codifies a route, or the selected machines,...

  4. Flow shop scheduling decisions through Techniques for Order Preference by Similarity to an Ideal Solution (TOPSIS)

    Gupta, Arun; Kumar, Shailendra
    The flow-shop scheduling problem (FSP) has been widely studied in the literature and having a very active research area. Over the last few decades, a number of heuristic/meta-heuristic solution techniques have been developed. Some of these techniques offer excellent effectiveness and efficiency at the expense of substantial implementation efforts and being extremely complicated. This paper brings out the application of a Multi-Criteria Decision Making (MCDM) method known as techniques for order preference by similarity to an ideal solution (TOPSIS) using different weighting schemes in flow-shop environment. The objective function is identification of a job sequence which in turn would have...

  5. Applying Total Quality Management Tools Using QFD at Higher Education Institutions in Gulf Area (Case Study: ALHOSN University)

    Al-Bashir, Adnan
    Human power’s quality plays the key role in the growth and development of societies where the quality of human powers can be enriched with the high quality education provided by the higher education institutions. The higher education institutions are hereby an important sector of any society since it defines the overall quality of human lives. This research will investigate the application of Total Quality Management (TQM) tools at the higher education institutions; specifically at ALHOSN University. In this study five tools were implemented at ALHOSN University’s engineering college including: Quality Function Deployment, Affinity Diagrams, Tree Diagrams, Pareto Charts, and Fishbone...

  6. A Mathematical Programming Model for Tactical Planning with Set-up Continuity in a Two-stage Ceramic Firm

    Pérez Perales, David; Alemany, M.M. Eva
    [EN] It is known that capacity issues in tactical production plans in a hierarchical context are relevant since its inaccurate determination may lead to unrealistic or simply non-feasible plans at the operational level. Semi-continuous industrial processes, such as ceramic ones, often imply large setups and their consideration is crucial for accurate capacity estimation. However, in most of production planning models developed in a hierarchical context at this tactical (aggregated) level, setup changes are not explicitly considered. Their consideration includes not only decisions about lot sizing of production, but also allocation, known as Capacitated Lot Sizing and Loading Problem (CLSLP). However,...

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.