An ACO approach for the Parallel Machines Scheduling Problem

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

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

2008

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.

The parallel machines scheduling problem (Pm) comprises the allocation of jobs on the system’s resources, i.e., a group of machines in parallel. The basic model consists of m identical machines and n jobs. The jobs are assigned according to resource availability following some allocation rule. In this work, we apply the Ant Colony Optimization (ACO) metaheuristic which includes in the construction solution process different specific heuristic to solve P<sub>m</sub> for the minimization Maximum Tardiness (T<sub>max</sub>). We also present a comparison of previous results obtained by a simple genetic algorithm (GAs) and an evidence of an improved performance of the ACO metaheuristic on this particular scheduling problem. Workshop de 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. (2008). An ACO approach for the Parallel Machines Scheduling Problem. SEDICI UNLP. http://sedici.unlp.edu.ar/handle/10915/21771

MLA

Gatica, Claudia R. et al. An ACO approach for the Parallel Machines Scheduling Problem. SEDICI UNLP, 2008. http://sedici.unlp.edu.ar/handle/10915/21771.

Chicago

Gatica, Claudia R. et al. 2008. An ACO approach for the Parallel Machines Scheduling Problem. SEDICI UNLP. http://sedici.unlp.edu.ar/handle/10915/21771.

Harvard

Gatica, C. R. E. A. 2008, An ACO approach for the Parallel Machines Scheduling Problem, SEDICI UNLP, available at: http://sedici.unlp.edu.ar/handle/10915/21771 [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: An ACO approach for the Parallel Machines Scheduling Problem

Author / contributors: Gatica, Claudia R. et al

Publisher: SEDICI UNLP

Publication year: 2008

Language: English

Subjects

Explore related resources through these subjects.

Ciencias Informáticas; Parallel; Scheduling; Optimization; Heuristic methods; Ant Colony Optimization (ACO)