Pasar al contenido principal

METAHEURISTICAS PARA LA ESTABILIDAD Y ROBUSTEZ EN SCHEDULING CON INCERTIDUMBRE

TIN2010-20976-C02-02

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2010
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario UNIVERSIDAD DE OVIEDO
Identificador persistente http://dx.doi.org/10.13039/501100004837

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)

Solving the job shop scheduling problem with operators by depth-first heuristic search enhanced with global pruning rules

  • Mencia, Carlos
  • Sierra, María R.
  • Varela, Ramiro
  • Miguel A. Salido|||0000-0002-4835-4057
  • Escamilla-Fuster, Joan
The job shop scheduling problem with an additional resource type has been recently proposed to model the situation where each operation in a job shop has to be assisted by one of a limited set of human operators. We confront this problem with the objective of minimizing the total flow time, which makes the problem more interesting from a practical point of view and harder to solve than the version with makespan minimization. To solve this problem we propose an enhanced dept-first search algorithm. This algorithm exploits a schedule generation schema termed OG&T, two admissible heuristics and some powerful pruning rules. In order to diversify the search, we also consider a variant of this algorithm with restarts. We have conducted an experimental study across several benchmarks. The results of this study show that the global pruning rules are really effective and that the proposed algorithms are quite competent for solving this problem., We are grateful to the anonymous referees for their comments and suggestions, that made it possible to improve this paper. This research has been supported by the Spanish Government under projects MEC-FEDER TIN-20976-C02-01 and TIN-20976-C02-02 and by the Principality of Asturias under Grant FICYT-BP09105.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A genetic algorithm for robust berth allocation and quay crane assignment

  • Rodríguez Molins, Mario
  • Ingolotti Hetter, Laura Paola
  • Sierra, María R.
  • Puente, Jorge
  • Barber, Federico|||0000-0002-3966-5742
  • Miguel A. Salido|||0000-0002-4835-4057
[EN] Scheduling problems usually obtain the optimal solutions assuming that the environment is deterministic. However, actually the environment is dynamic and uncertain. Thus, the initial data could change and the initial schedule obtained might be unfeasible. To overcome this issue, a proactive approach is presented for scheduling problems without any previous knowledge about the incidences that can occur. In this paper, we consider the berth allocation problem and the quay crane assignment problem as a representative example of scheduling problems where a typical objective is to minimize the service time. The robustness is introduced within this problem by means of buffer times that should be maximized to absorb possible incidences or breakdowns. Therefore, this problem becomes a multi-objective optimization problem with two opposite objectives: minimizing the total service time and maximizing the robustness or buffer times., This research was supported by the Spanish Government under research projects TIN2010-20976-C02-01 and TIN2010-20976-C02-02 (Min. de Ciencia e Innovación, Spain), the project PIRSES-GA-2011-294931 (FP7-PEOPLE-2011-IRSES) and the predoctoral FPU fellowship (AP2010-4405).