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

A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem

Minetti, Gabriela F. et al · SEDICI UNLP · 2000

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
Minetti, Gabriela F. et al
Publisher
SEDICI UNLP
Year
2000
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.

Over the past few years, a continually increasing number of research efforts have investigated the application of evolutionary computation techniques for the solution of scheduling problems. Scheduling problems can pose extremely complex combinatorial optimization problems, which belong to the NP-hard family. This work shows how an evolutionary approach using different chromosome representations with multiplicity feature MCMP can efficiently solve the JSSP. I 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

Minetti, G. F. E. A. (2000). A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem. SEDICI UNLP. http://sedici.unlp.edu.ar/handle/10915/23428

MLA

Minetti, Gabriela F. et al. A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem. SEDICI UNLP, 2000. http://sedici.unlp.edu.ar/handle/10915/23428.

Chicago

Minetti, Gabriela F. et al. 2000. A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem. SEDICI UNLP. http://sedici.unlp.edu.ar/handle/10915/23428.

Harvard

Minetti, G. F. E. A. 2000, A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem, SEDICI UNLP, available at: http://sedici.unlp.edu.ar/handle/10915/23428 [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
A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem
Author / contributors
Minetti, Gabriela F. et al
Publisher
SEDICI UNLP
Publication year
2000
Language
English

Subjects

Explore related resources through these subjects.

Ciencias Informáticas; evolutionary algorithms; multiplicity; Scheduling; Optimization
Copied