Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 2
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A Framework for Improving Planning-Scheduling Collaboration in Industrial Production Environment

  • Gómez-Gasquet, Pedro|||0000-0002-9184-6735
  • Lario Esteban, Francisco Cruz
  • Franco Pereyra, Rubén Darío
  • Anaya Fons, Víctor Alonso
[EN] The work presented in this paper highlights how a real scheduling problem can be considered as a process avoiding the traditional operation research-based approach. Understanding the scheduling problem as a dynamic, uncertain and continuous process, in order to reduce the gap between reality and academic models, new conceptual elements emerge. The framework includes methodologies, concepts, architecture, and algorithms, which are based on the idea of a multiagent system in which planning-scheduling relationship is the core proposal. From the framework a software platform has been developed and tested in real industry., This work has been carried out as part of the project “DPI2008-06788-C02-01 (PERMACASI)” funded by Ministerio de Ciencia e Innovación of the Spanish Government and as part of the project “PAID-06-10-2396 (NegoSol-MAS)” funded by Vicerrectorado de Investigación of Universidat Politècnica de València.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

An agent-based genetic algorithm for hybrid flowshops with sequence dependent setup times to minimise makespan

  • Gómez-Gasquet, Pedro|||0000-0002-9184-6735
  • Andrés Romano, Carlos|||0000-0003-4453-4891
  • Lario Esteban, Francisco Cruz
This paper deals with a variant of flowshop scheduling, namely, the hybrid or flexible flowshop with sequence dependent setup times. This type of flowshop is frequently used in the batch production industry and helps reduce the gap between research and operational use. This scheduling problem is NP-hard and solutions for large problems are based on non-exact methods. An improved genetic algorithm (GA) based on software agent design to minimise the makespan is presented. The paper proposes using an inherent characteristic of software agents to create a new perspective in GA design. To verify the developed metaheuristic, computational experiments are conducted on a well-known benchmark problem dataset. The experimental results show that the proposed metaheuristic outperforms some of the well-known methods and the state-of-art algorithms on the same benchmark problem dataset., The translation of this paper was funded by Universidad Politecnica de Valencia, Spain.