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

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

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

Rossit, Daniel Alejandro et al

Publisher

Pergamon-Elsevier Science Ltd

Year

2018

ISSN

0305-0483

ISSN

0305-0483

Language

English

Resource access

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

CONICET Digital CONICET Digital OAI-PMH

Entrar por CONICET Digital

Main access

Open-access full text

Texto completo identificado como acceso abierto.

Open text

Summary

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

How to cite

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].

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: The Non-Permutation Flow-Shop scheduling problem: A literature review

Author / contributors: Rossit, Daniel Alejandro et al

Publisher: Pergamon-Elsevier Science Ltd

Publication year: 2018

ISSN: 0305-0483

ISSN: 0305-0483

Language: English

Subjects

Explore related resources through these subjects.

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