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

Solving the flow shop scheduling problem under evolutionary approaches

Vilanova, Gabriela et al · SEDICI UNLP · 2001

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
Vilanova, Gabriela et al
Publisher
SEDICI UNLP
Year
2001
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 flow shop scheduling problem (FSSP) [12], has held the attention of many researchers. In a simplest usual situation, a set of jobs must follow the same route to be executed on a set of machines (resources) and the main objective is to optimize some performance variable (makespan, tardiness, lateness, etc.). In the case of the makespan, it have been proved that when the number of machines is greater than or equal to three, the problem is NP-hard. Eje: Inteligencia Computacional - Metaheurísticas 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

Vilanova, G. E. A. (2001). Solving the flow shop scheduling problem under evolutionary approaches. SEDICI UNLP. http://sedici.unlp.edu.ar/handle/10915/21670

MLA

Vilanova, Gabriela et al. Solving the flow shop scheduling problem under evolutionary approaches. SEDICI UNLP, 2001. http://sedici.unlp.edu.ar/handle/10915/21670.

Chicago

Vilanova, Gabriela et al. 2001. Solving the flow shop scheduling problem under evolutionary approaches. SEDICI UNLP. http://sedici.unlp.edu.ar/handle/10915/21670.

Harvard

Vilanova, G. E. A. 2001, Solving the flow shop scheduling problem under evolutionary approaches, SEDICI UNLP, available at: http://sedici.unlp.edu.ar/handle/10915/21670 [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
Solving the flow shop scheduling problem under evolutionary approaches
Author / contributors
Vilanova, Gabriela et al
Publisher
SEDICI UNLP
Publication year
2001
Language
English

Subjects

Explore related resources through these subjects.

Ciencias Informáticas; Solving the flow shop scheduling problem; evolutionary approaches; Scheduling; ARTIFICIAL INTELLIGENCE
Copied