News Help Institutional access
Back to results
Bibliographic record · Consultation and access
Document

Comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machines

Gatica, Claudia R. et al · SEDICI UNLP · 2012

Open-access full text
Quick overview. Review the resource’s basic details, then access the content using the main button. This page shows only the information needed to identify, cite, and open the work.
Author / responsible party
Gatica, Claudia R. et al
Publisher
SEDICI UNLP
Year
2012
Language
English

Resource access

Open the content from the main option or choose another available source.

SEDICI UNLP SEDICI UNLP OAI-PMH
Entrar por SEDICI UNLP
Main access

Open-access full text

Texto completo identificado como acceso abierto.
Open text

Summary

Descripción general del contenido del recurso.

In this paper we present a comparative study of four trajectory metaheuristics or single-solution based metaheuristics (S-meta heuristics): Iterated Local Search (ILS), Greedy Randomized Adaptive Search Procedure (GRASP), Variable Neighborhood Search (VNS) and Simulated Annealing (SA). The metaheuristics were used to minimize the Maximum Tardiness (Tmax) for unrestricted parallel identical machine scheduling (Pm) problem, which is considered as NP-Hard problem. The results obtained through experimentation show that SA was the best behaved. Eje: Workshop Agentes y sistemas inteligentes (WASI) Red de Universidades con Carreras en Informática (RedUNCI)

How to cite

Elegí el formato que necesitás y copiá la referencia al portapapeles.

APA 7

Gatica, C. R. E. A. (2012). Comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machines. SEDICI UNLP. http://sedici.unlp.edu.ar/handle/10915/23606

MLA

Gatica, Claudia R. et al. Comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machines. SEDICI UNLP, 2012. http://sedici.unlp.edu.ar/handle/10915/23606.

Chicago

Gatica, Claudia R. et al. 2012. Comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machines. SEDICI UNLP. http://sedici.unlp.edu.ar/handle/10915/23606.

Harvard

Gatica, C. R. E. A. 2012, Comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machines, SEDICI UNLP, available at: http://sedici.unlp.edu.ar/handle/10915/23606 [Accessed 7 Aug. 2026].

Share and print

Save the record, copy its permanent link, or print it as a PDF.

Export reference

You can export the record in common formats for use in a reference manager.

RIS BibTeX

Resource details

Bibliographic information to help confirm that this is the correct material.

Title
Comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machines
Author / contributors
Gatica, Claudia R. et al
Publisher
SEDICI UNLP
Publication year
2012
Language
English

Subjects

Explore related resources through these subjects.

Ciencias Informáticas; Iterated Local Search; Greedy Randomized Adaptive Search Procedure; Variable Neighborhood Search; Simulated Annealing; Parallel Machines Scheduling; Maximum Tardiness; Statistical Nonparametric Tests; Scheduling; Simulation; Parallel; Intelligent agents
Copied