The Non-Permutation Flow-Shop scheduling problem: A literature review

Rossit, Daniel Alejandro et al · Pergamon-Elsevier Science Ltd · 2018

Testo completo ad accesso aperto

Lettura rapida. Controlla i dati essenziali della risorsa e accedi al contenuto con il pulsante principale. La scheda mostra solo le informazioni necessarie per identificare, citare e aprire l’opera.

Autore / responsabile

Rossit, Daniel Alejandro et al

Editore

Pergamon-Elsevier Science Ltd

Anno

2018

ISSN

0305-0483

ISSN

0305-0483

Lingua

Inglés

Accesso alla risorsa

Apri il contenuto dall’opzione principale o scegli un’altra fonte disponibile.

CONICET Digital CONICET Digital OAI-PMH

Entrar por CONICET Digital

Accesso principale

Testo completo ad accesso aperto

Texto completo identificado como acceso abierto.

Apri testo

Riepilogo

Descripción general del contenido del recurso.

The Non-Permutation Flow-Shop scheduling problem (NPFS) is a generalization of the traditional Permutation Flow-Shop scheduling problem (PFS) that allows changes in the job order on different machines. The flexibility that NPFS provides in models for industrial applications justifies its use despite its combinatorial complexity. The literature on this problem has expanded largely in the last decade, indicating that the topic is an active research area. This review is a contribution towards the rationalization of the developments in the field, organizing them in terms of the objective functions in the different variants of the problem. A schematic presentation of both theoretical and experimental results summarizes many of the main advances in the study of NPFS. Finally, we include a bibliometric analysis, showing the most promising lines of future development. Fil: Rossit, Daniel Alejandro. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca; Argentina. Universidad Nacional del Sur. Departamento de Ingeniería; Argentina Fil: Tohmé, Fernando Abel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca; Argentina. Universidad Nacional del Sur. Departamento de Economía; Argentina

Come citare

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

APA 7

Rossit, D. A. E. A. (2018). The Non-Permutation Flow-Shop scheduling problem: A literature review. http://hdl.handle.net/11336/62858

MLA

Rossit, Daniel Alejandro et al. "The Non-Permutation Flow-Shop scheduling problem: A literature review." 2018. http://hdl.handle.net/11336/62858.

Chicago

Rossit, Daniel Alejandro et al. 2018. "The Non-Permutation Flow-Shop scheduling problem: A literature review.". http://hdl.handle.net/11336/62858.

Harvard

Rossit, D. A. E. A. 2018, The Non-Permutation Flow-Shop scheduling problem: A literature review, Pergamon-Elsevier Science Ltd, available at: http://hdl.handle.net/11336/62858 [Accessed 7 Aug. 2026].

Condividi e stampa

Salva la scheda, copia il link permanente o stampala in PDF.

Esporta riferimento

Esporta il record nei formati più comuni per usarlo con un gestore bibliografico.

RIS BibTeX

Dettagli della risorsa

Informazioni bibliografiche utili per verificare che sia il materiale corretto.

Titolo: The Non-Permutation Flow-Shop scheduling problem: A literature review

Autore / collaboratori: Rossit, Daniel Alejandro et al

Editore: Pergamon-Elsevier Science Ltd

Anno di pubblicazione: 2018

ISSN: 0305-0483

ISSN: 0305-0483

Lingua: Inglés

Soggetti

Esplora risorse correlate a partire da questi soggetti.

Flow-Shop; Non-Permutation Flow-Shop; Review; Scheduling